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(listi,low,high,x):
	mid=(low+high+1)/2
	while(low<high):
		if listi[mid]==x:
			return True
		elif listi[mid]<x:
			return bSearch(listi, mid+1, high, x)
		else:
			return bSearch(listi, low, mid-1, x)
	if low==high:
		return listi[low]==x
		
inp=[int(i) for i in raw_input().split()]
n=inp[0]
q=inp[1]
listi=[int(i) for i in raw_input().split()]
listi.sort()
for i in range(q):
	t=input()
	if bSearch(listi,0,len(listi)-1,t):
		print "YES"
	else:
		print "NO"