#include <iostream>
#include <algorithm>
using namespace std;

bool BinarySearch(int a[],int l, int r,int num){
    while (l <= r){
        int mid = (l+r)/2;
        if (a[mid] == num) return true;

        else if (a[mid] > num) r = mid-1;
        else l = mid+1;
    }
    return false;
}
int main(){
    freopen("S01.INP",'r',stdin);
    freopen("S01.OUT",'w',stdout);
    int n,q;cin>>n>>q;
    int a[n];
    for (int i = 0 ; i < n;++i) cin>>a[i];
    sort(a,a+n);

    for (int i = 0 ; i < q;++i){
        int x;cin>>x;
        cout<<BinarySearch(a,0,n-1,x)<<endl;
    }
}