#include<bits/stdc++.h>
using namespace std;
const int MaxN=5e5;
int num[MaxN];
int N,Q,x;
int main(){
while(cin>>N>>Q){
for(int n=0;n<N;n++)
cin>>num[n];
sort(num,num+N);
for(int q=0;q<Q;q++){
cin>>x;
if(x<num[0]){
cout<<0<<"\n";
continue;
}
int ans=upper_bound(num,num+N,x)-num;
//第一個大於x的位置
if(ans%2==0)
cout<<0<<"\n";
else
cout<<1<<"\n";
}
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNYXhOPTVlNTsKaW50IG51bVtNYXhOXTsKaW50IE4sUSx4OwoKaW50IG1haW4oKXsKCXdoaWxlKGNpbj4+Tj4+USl7CgkJZm9yKGludCBuPTA7bjxOO24rKykKCQkJY2luPj5udW1bbl07CgkJc29ydChudW0sbnVtK04pOwoJCWZvcihpbnQgcT0wO3E8UTtxKyspewoJCQljaW4+Png7CgkJCWlmKHg8bnVtWzBdKXsKCQkJCWNvdXQ8PDA8PCJcbiI7CgkJCQljb250aW51ZTsKCQkJfQoJCQkKCQkJaW50IGFucz11cHBlcl9ib3VuZChudW0sbnVtK04seCktbnVtOwoJCQkvL+esrOS4gOWAi+Wkp+aWvHjnmoTkvY3nva4KCQkJaWYoYW5zJTI9PTApCgkJCQljb3V0PDwwPDwiXG4iOwoJCQllbHNlCgkJCQljb3V0PDwxPDwiXG4iOwoJCQkKCQl9Cgl9CglyZXR1cm4gMDsKfQ==