import math
n,x=map(int,input().split())
a=[]
b=dict()
for i in range(n):
    num=int(input())
    a.append(num)
    if num not in b:
        b[num]=1
    else:
        b[num]+=1

c=list(set(a))
#print(b)
#print(c)
ans=0
if x==0:
    def combinations_count(n, r):
        return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

    for i in b.values():
        ans+=combinations_count(i,2)
    
else:
    for i in c:
        m=x^i
        if m in b:
            ans+=b[m]*b[i]
    ans=ans//2
print(ans)