1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <cstdio>
 5 #include <cmath>
 6 #include <stack>
 7 #include <set>
 8 #include <map>
 9 #include <queue>
10 #include <climits>
11 
12 using namespace std;
13 const int MAX = 1e6 + 10;
14 int n, m, temp, A[MAX];
15 
16 bool is_include(int temp)
17 {
18     int l = 0, r = n-1, mid = n / 2;
19     while(l <= r)
20     {
21         if (A[mid] == temp) return true;
22         else if (A[mid] > temp)
23         {
24             r = mid - 1;
25             mid = (l + r) / 2;
26         }
27         else
28         {
29             l = mid + 1;
30             mid = (l + r) / 2;
31         }
32     }
33     return false;
34 }
35 
36 int main()
37 {
38     cin >> n >>m;
39 
40     for(int i = 0; i < n; ++ i)
41     {
42         scanf("%d", &A[i]);
43     }
44     sort(A, A+n, less<int>());
45 
46     for(int i = 0; i < m; ++ i)
47     {
48         scanf("%d", &temp);
49         if (is_include(temp))
50             printf("YES\n");
51         else
52             printf("NO\n");
53     }
54 }