import sys

# sys.setrecursionlimit(1000005)
# 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 << 63)
# md = 10**9+7
md = 998244353

def hadamard(aa):
    k = 1
    while k < len(aa):
        for i in range(len(aa)):
            if i & k: aa[i ^ k], aa[i] = aa[i ^ k]+aa[i], aa[i ^ k]-aa[i]
        k <<= 1

lim=1<<18
n,x=LI()
aa=LI()

cc=[0]*lim
for a in aa:cc[a]+=1
hadamard(cc)
for i in range(lim):cc[i]**=2
hadamard(cc)
for i in range(lim):cc[i]//=lim
ans=(lim-1)*(sum(cc[:x])-n)

base=1
for i in range(18):
    cc = [0]*lim
    cnt=0
    for a in aa:
        if a&base:continue
        cc[a] += 1
        cnt+=1
    hadamard(cc)
    for i in range(lim): cc[i] **= 2
    hadamard(cc)
    for i in range(lim): cc[i] //= lim
    ans -= base*(sum(cc[:x])-cnt)
    base<<=1

print(ans//2)