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 bin(a,n):
    start=0
    end=len(a)-1
    while True:
        if end<start:
            return -1
        mid=(start+end)//2
        if n<a[mid]:
             end=mid-1
        elif n>a[mid]:
             start=mid+1
        elif n==a[mid]:
            #print 'element found at index %d'%mid
            return 1
n,q=[int(i) for i in raw_input().split()]
x=[int(i) for i in raw_input().split()]
x.sort()
Q=[]
for i in range(q):
    t=int(raw_input())
    Q.append(t)
for i in Q:
    if bin(x,i)==1:
        #print x,i
        print 'YES'
    else:
        print 'NO'