import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

from collections import defaultdict

n,k=LI()
aa=LI()

cs=[0]
for a in aa:cs.append(cs[-1]^a)

pre=defaultdict(lambda :-1)
cnt=0
imo=[0]*(n+1)
for i,b in enumerate(cs):
    if pre[b]!=-1:
        j=pre[b]
        imo[j]+=1
        imo[i]-=1
        cnt+=1
    pre[b]=i
# pDB(cs)

if not pre:
    print("Yes")
    exit()

for i in range(n):imo[i+1]+=imo[i]
# pDB(imo)

def ok(x):
    ng=[0]*(n+2)
    pos={}
    for i,b in enumerate(cs):
        if x^b in pos:
            j=pos[x^b]
            ng[j]+=1
            ng[i]-=1
        if b not in pos:
            pos[b]=i
    # print(pos,ng)
    for i in range(n):
        ng[i+1]+=ng[i]
        if ng[i]==0 and imo[i]==cnt and abs((aa[i]^x)-aa[i])<=k:
            # print(x,i)
            return True
    return False

for u in range(14):
    u=(1<<u)-1<<7
    for x in range(u,u+128):
        if ok(x):
            print("Yes")
            exit()
print("No")