def compare(a,b):
  # 比較関数 (a<=b)
  
  if min(a,a^x)<=min(b,b^x):
    return True
  else:
    return False


def merge(l, r):
    new = []
    ln = 0
    rn = 0
    while ln < len(l) and rn < len(r):
        if compare(l[ln],r[rn]):
            new.append(l[ln])
            ln += 1
        else:
            new.append(r[rn])
            rn += 1
    for i in range(ln, len(l)):
        new.append(l[i])
    for i in range(rn, len(r)):
        new.append(r[i])
    return new
 
def MergeSort(l):
    if len(l) == 0:
        return []
    if len(l) == 1:
        return l
    else:
        a = l[:len(l)//2]
        b = l[len(l)//2:]
        return merge(MergeSort(a), MergeSort(b))

n,x=map(int,input().split())
a=list(map(int,input().split()))
a=MergeSort(a)
for i in range(n-1):
  if a[i]<a[i+1]^x and a[i]^x<a[i+1]:
    pass
  else:
    print('No')
    exit()
print('Yes')