You are given an array A of size N, and Q queries to deal with. For each query, you are given an integer X, and you're supposed to find out if X is present in the array A or not.

Input:
The first line contains two integers, N and Q, denoting the size of array A and number of queries. The second line contains N space separated integers, denoting the array of elements Ai. The next Q lines contain a single integer X per line.

Output:
For each query, print YES if the X is in the array, otherwise print NO.

Constraints:
1 ≤ N, Q ≤ 10^5
1 ≤ Ai ≤ 10^9
1 ≤ X ≤ 10^9

SAMPLE INPUT
5 10
50 40 30 20 10
10
20
30
40
50
60
70
80
90
100

SAMPLE OUTPUT
YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
def search(series,x,n):
    search_list = list()
    for a in range(len(x)):
        num = x[a]
        first = 0
        last = n-1
        res = 'NO'
        while first <= last and res == 'NO':
            mid = (first + last)/2
            if series[mid] == num:
                res = 'YES'
            else:
                if num < series[mid]:
                    last = mid - 1
                else:
                    first = mid + 1
        search_list.append(res)
    return search_list

t = raw_input()
l = t.split()
n = int(l[0])
q = int(l[1])
series_str = raw_input()
series = series_str.split()
series = map(int, series)
series.sort() 
x = list()
for i in range(1, q+1):
    s = int(raw_input())
    x.append(s)
search_list = search(series,x,n)
for b in range(len(search_list)):
    print search_list[b]