Biinary search example 1

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

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

for y in input().split():
  y = int(y)
  if binary_search(a, y):
    print("YES")
  else:
    print("NO")