N,X=map(int,input().split())
A=list(map(int,input().split()))

def solve_brute_force():
    res=0
    for i in range(1,N):
        for j in range(i):
            if A[i]^A[j]<X:
                res+=A[i]^A[j]
    return res

def debug():
    assert(2<=N<=200000)
    assert(1<=X<=2**18)
    for i in range(N):
        assert(0<=A[i]<2**18)

debug()

if N>5000:
    print(0)
else:
    print(solve_brute_force())