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 bsearch(A, x, l, r):
	while l <= r:
		mid = (l + r) / 2
		if A[mid] == x:
			return mid
		elif A[mid] < x:
			l = mid + 1
		else:
			r = mid - 1
	return -1	
	
n,r = map(int, raw_input().split())
#print n, r
A = map(int, raw_input().split())
A.sort()
#print A
for i in xrange(r):
    x = int(raw_input())    
    if bsearch(A, x, 0, len(A)-1) != -1:
        print "YES"
    else:
        print "NO"