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 bin_search(a,k):
    lb=0
    ub=len(a)-1
    mid=(lb+ub)//2
    #print mid
    while(lb<=ub):
        mid=(lb+ub)//2
        if k>a[mid]:
            lb=mid+1
        elif k<a[mid]:
            ub=mid-1
        elif k==a[mid]:
            return True
        #print lb,ub,mid
    return False
            


s=raw_input()
n=int(s.split(' ')[0])
q=int(s.split(' ')[1])
a=[]
a=map(int,raw_input().split(' '))
#print a
a.sort()
while q>0:
    k=int(raw_input())
    if bin_search(a,k):
        print "YES"
    else:
        print "NO"
    q-=1