Problem: 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

Solution (in PYTHON):

Solution:
N, Q = map(int, raw_input().split())
A = map(int,raw_input().split())
A.sort()

def binary_s(low, high, val):
	if low==high:
		return low

	mid = (low+high)>>1
	if A[mid]>val:
		high = mid
		return binary_s(low, high, val)	
	else:
		if low == mid:
			return low
		low = mid
		return binary_s(low, high, val)

for q in xrange(Q):
	q = input()
	if q >= A[0] and q <= A[N-1]:
		a_index = binary_s(0, N, q)
		if A[a_index] == q:
			print 'YES'
		else:
			print 'NO'	
	else:
		print 'NO'