Бинарный поиск

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n, k;
        n = in.nextInt();
        k = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }
        for (int i = 0; i < k; i++) {
            int x = in.nextInt();
            int l = 0, r = n - 1;
            boolean flag = true;
            while (l <= r) {
                int m = (r + l) / 2;
                if (x == a[m]){
                    System.out.println("YES");
                    flag = false;
                    break;
                }
                if (x < a[m])
                    r = m - 1;
                else
                    l = m + 1;
            }

            if (flag)
                System.out.println("NO");

        }
    }
}