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 binary_search(a,num):
    first=0
    last=len(a)-1 
    while(first<=last):
        mid=(first+last)//2
        if a[mid]==num:
            return mid
        elif a[mid]>num:
            last=mid-1
        else:
            first=mid+1
    return -1

var=list(map(int,raw_input().split()))
n=var[0]
m=var[1]
l=list(map(int,raw_input().split()))
l.sort()
for i in range(0,m,1):
    k=int(input())
    c=binary_search(l,k)
    if c==-1:
        print("NO")
    else:
        print("YES")