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 bs(arr, q):
	start = 0
	end = len(arr) - 1
	while True:
		i = (start + end) / 2
		if arr[i] == q:
			return True
		elif arr[i] < q:
			start = i + 1
		else:
			end = i - 1
		if start > end:
			return False

len_arr, len_q = map(int, raw_input().strip().split(" "))
arr = map(int, raw_input().strip().split(" "))
arr.sort()
for i in range(len_q):
	q = int(raw_input().strip())
	if bs(arr, q):
		print "YES"
	else:
		print "NO"