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:
def isHere(arr,data):
	l = 0
	r = len(arr)-1
 	while l<=r:
 		mid = (l+r)//2
 		if(arr[mid]==data):
 			return True
 		elif data>arr[mid]:
 			l = mid+1
 		else:
 			r = mid-1
 	return False

n,q = [int(i) for i in raw_input().split()]
arr = [int(i) for i in raw_input().split()]
arr.sort()
while(q>0):
	data = int(raw_input())
	if isHere(arr,data):
		print 'YES'
	else:
		print'NO'
	q-=1