#include <bits/stdc++.h>
using namespace std;

int m, n, nums[1000005], ask;

int main() {
    scanf("%d%d", &m, &n);
    for (int i = 0; i < m; ++i) {
        scanf("%d", &nums[i]);
    }
    sort(nums, nums + m);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &ask);
        int le = 0, ri = m - 1, mid;
        while (le <= ri) {
            mid = (le + ri) / 2;
            if (nums[mid] > ask) {
                ri = mid - 1;
            } else if (nums[mid] < ask) {
                le = mid + 1;
            } else {
                printf("YES\n");
                break;
            }
        }
        if (le > ri) {
            printf("NO\n");
        }
    }
    return 0;
}