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:
def query(N,Nsize,line_query):    
    low=0
    high=Nsize-1
    while(low<=high):
        mid=(low+high)//2
        if(N[mid]>line_query):
            high = mid-1
        elif(N[mid]<line_query):
            low = mid+1
        else:
            return "YES"
            break
    return "NO"

if __name__ == "__main__":
    testcases =  raw_input()
    N=testcases.split(" ")
    Narray = map(int,raw_input().split())
    Narray.sort()
    for caseNr in xrange(1, int(N[1])+1):          
        line_query = int(raw_input())
        print query(Narray,int(N[0]),line_query)