#include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long n, k, a[100000], b[100000], middle;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[ i ];
}
sort (a, a+n);
for(int i = 0; i < k; i++) {
cin >> b[ i ];
}
for(int i = 0; i < k; i++) {
long long left = 0;
long long right = n - 1;
while( left <= right && a[middle] != b[ i ]) {
middle = ( left + right ) / 2;
if(a[middle] < b[ i ]) left = middle + 1;
if(a[middle] > b[ i ]) right = middle - 1;
}
if ( left > right ) cout << "NO" << endl;
else cout << "YES" << endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7Cglsb25nIGxvbmcgbiwgaywgYVsxMDAwMDBdLCBiWzEwMDAwMF0sIG1pZGRsZTsKCWNpbiA+PiBuID4+IGs7Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCWNpbiA+PiBhWyBpIF07Cgl9CiAgICAgICAgICAgICAgICAgIHNvcnQgKGEsIGErbik7Cglmb3IoaW50IGkgPSAwOyBpIDwgazsgaSsrKSB7CgkJY2luID4+IGJbIGkgXTsKCX0KCWZvcihpbnQgaSA9IDA7IGkgPCBrOyBpKyspIHsKCQlsb25nIGxvbmcgbGVmdCA9IDA7CgkJbG9uZyBsb25nIHJpZ2h0ID0gbiAtIDE7CgkJd2hpbGUoIGxlZnQgPD0gcmlnaHQgJiYgYVttaWRkbGVdICE9IGJbIGkgXSkgewoJCSAgICBtaWRkbGUgPSAoIGxlZnQgKyByaWdodCApIC8gMjsKCQkgICAgaWYoYVttaWRkbGVdIDwgYlsgaSBdKSBsZWZ0ID0gbWlkZGxlICsgMTsKCQkgICAgaWYoYVttaWRkbGVdID4gYlsgaSBdKSByaWdodCA9IG1pZGRsZSAtIDE7CiAgICAgICAgICAgICAgICAgICAgICB9CgkgICAgICAgICAgICAgICAgaWYgKCBsZWZ0ID4gcmlnaHQgKSBjb3V0IDw8ICJOTyIgPDwgZW5kbDsKCQkgICAgIGVsc2UgY291dCA8PCAiWUVTIiA8PCBlbmRsOwoJfQoJcmV0dXJuIDA7Cn0=