3. Двоичный поиск

import java.io.*;
import java.util.*;

public class Main {

    static int[] a;
    static int n;

    public static boolean binSearch(int x) {
        int l = 0;
        int r = n - 1;
        while (l < r) {
            int m = (l + r) / 2;
            if (a[m] < x)
                l = m + 1;
            else
                r = m;
        }

        return a[r] == x;
    }

    public static void main(String args[]) {
        try (PrintWriter out = new PrintWriter(System.out);) {
            Scanner in = new Scanner(System.in);
            n = in.nextInt();
            int k = in.nextInt();
            a = new int[n];
            for (int i = 0; i < n; i++) a[i] = in.nextInt();
            for (int i = 0; i < k; i++)
                out.println(binSearch(in.nextInt()) ? "YES" : "NO");
        } catch(Exception e) {
            System.out.println("Exception: " + e);
        }
    }
}