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(list, query):

    i = 0
    j = len(list)-1

    while i<=j:

        mid = (i+j)/2

        if query == list[mid]:
            return 'YES'
        elif query < list[mid]:
            j = mid-1
        else:
            i = mid+1

    return 'NO'


test_cases, queries = raw_input().split()

arr = raw_input().split()
arr = [int(x) for x in arr]

arr.sort()

queries = int(queries)

i = 0
while i < queries:
    query = int(raw_input())

    print binary_search(arr,query)

    i += 1