import sequtils,strutils,algorithm
var
    N, X : int64
    A : seq[int64]
    B : seq[int64]
    ans : int
    f :array[100010, int]

(N, X) = stdin.readline.split.map(parseBiggestInt)

for i in 1..N:
    A.add(stdin.readline.parseBiggestInt)

A.sort(cmp)

for a in A:
    if B.len == 0 or B[^1] != a:
         B.add(a)
    f[B.high] += 1
for i,a in B:
    var k : int64 = (X xor a)
    var j = B.lowerbound(k)

    if B[j] != k:
        continue
    ans += f[j] * f[i]

echo (ans div 2)