Binary search example 1

from bisect  import bisect_left, bisect_right

n, k = map(int, input().split())
a = [int(x) for x in input().split()]

def binary_search(x, a):
    left = 0
    right = len(a)
    while right - left > 1:
        mid = (left + right) // 2
        if a[mid] > x:
            right = mid
        else:
            left = mid
    return a[left] == x

for x in input().split():
    x = int(x)
    if bisect_left(a, x) != bisect_right(a, x):
        print('YES')
    else:
        print('NO')