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
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
def discover_the_monk(array, left,right,x):
    if left <= right:
        mid = left + ( right - left ) / 2
        if array[mid] == x:
            return 'YES'
        elif x > array[mid]:
            return discover_the_monk(array, mid + 1, right, x)
        else:
            return discover_the_monk(array, left, mid-1, x)
    else:
        return 'NO'

if __name__ == "__main__":
	n,q = map(int, raw_input().split())
	array = sorted(map(int, raw_input().split()))
	mini, maxi = array[0], array[-1]
	for _ in xrange(q):
		x = int(raw_input())
		print discover_the_monk(array, 0,n-1, x)