#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool f(ll a[],ll n,ll x) {
    ll t=0;
    ll  p= n - 1;
    while (t<=p) {
        ll g=t+(p-t)/2;
        if (a[g] == x) {
            return true;
        }
        else 
        if (a[g]<x) {
            t=g+1;
        }
        else {
            p=g-1;
        }
    }
    return false;
}
int main() {
    ll n,k;
    cin>>n>>k;
    ll a[n];
    for (ll i=0;i<n;++i) {
        cin>>a[i];
    }
    sort(a,a+n);
    for (ll i=0;i<k;++i) {
        ll x;
        cin>>x;
        if (f(a,n,x)) {
            cout<<"YES"<<'\n';
        } else {
            cout<< "NO"<<'\n';
        }
    }
    return 0;
}