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:
a=raw_input()
a=a.split()
a=map(int,a)
b=raw_input()
b=map(int,b.split())
b.sort()

def search(n):
    low=0
    high=len(b)-1
    while high>=low:
        mid = (high+low)/2
        if b[mid]==n:
            return True
        elif b[mid]<n:
            low=mid+1
        elif b[mid]>n:
            high=mid-1
    return False

while a[1]>0:
    c=input()
    if search(c):
        print 'YES'
    else:
        print 'NO'
    a[1]=a[1]-1