C

#include<bits/stdc++.h>

using namespace std;

int n,k;
int a[100000];
int b[100000];

int binarySearch(int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;

        if (a[mid] == x)
            return mid;

        if (a[mid] > x)
            return binarySearch(l, mid - 1, x);

        return binarySearch(mid + 1, r, x);
    }
    return -1;
}

int main() {
    cin >> n >> k;
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<k;i++) cin >> b[i];
    for(int i=0;i<k;i++)
        cout << (binarySearch(0,n-1,b[i]) != -1? "YES" : "NO") << "\n";
}