mod = 1000000007 eps = 10**-9 def main(): import sys from collections import Counter input = sys.stdin.readline def plus(a, b): return a+b def f(A, B): return [a + b for a, b in zip(A, B)] ident = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0) class SegmentTree: def __init__(self, A, initialize=True, segfunc=f, ident=ident): self.N = len(A) self.LV = (self.N - 1).bit_length() self.N0 = 1 << self.LV self.segfunc = segfunc self.ident = ident if initialize: self.data = [self.ident] * self.N0 + A + [self.ident] * (self.N0 - self.N) for i in range(self.N0 - 1, 0, -1): self.data[i] = segfunc(self.data[i * 2], self.data[i * 2 + 1]) else: self.data = [self.ident] * (self.N0 * 2) def update(self, i, x): i += self.N0 - 1 self.data[i] = x for _ in range(self.LV): i >>= 1 self.data[i] = self.segfunc(self.data[i * 2], self.data[i * 2 + 1]) # open interval [l, r) def query(self, l, r): l += self.N0 - 1 r += self.N0 - 1 ret_l = self.ident ret_r = self.ident while l < r: if l & 1: ret_l = self.segfunc(ret_l, self.data[l]) l += 1 if r & 1: ret_r = self.segfunc(self.data[r - 1], ret_r) r -= 1 l >>= 1 r >>= 1 return self.segfunc(ret_l, ret_r) # return smallest i(l <= i < r) s.t. check(A[i]) == True def binsearch(self, l, r, check): if not check(self.query(l, r)): return r l += self.N0 - 1 val = self.ident while True: if check(self.segfunc(val, self.data[l])): break if l & 1: val = self.segfunc(val, self.data[l]) l += 1 l >>= 1 while l < self.N0: newval = self.segfunc(val, self.data[l * 2]) if not check(newval): val = newval l = (l << 1) + 1 else: l <<= 1 return l - self.N0 + 1 N, X = map(int, input().split()) A = list(map(int, input().split())) NN = 2**18 ST = SegmentTree([ident for _ in range(NN)], initialize=False) ST_cnt = SegmentTree([0] * NN, initialize=False, segfunc=plus, ident=0) C = Counter(A) for a in C: tmp = [0] * 18 for i in range(18): tmp[i] = (1 - (a >> i & 1)) * C[a] ST.update(a+1, tuple(tmp)) ST_cnt.update(a+1, C[a]) ans = 0 if X == 2**18: assert False for a in A: zero_bit = [] for i in range(18): if not a >> i & 1: zero_bit.append(i) current_node = 1 for i in range(17, -1, -1): x = X >> i & 1 aa = a >> i & 1 if x == 1: y = aa small_node = current_node * 2 + y ans += (NN-1) * ST_cnt.data[small_node] num = ST.data[small_node] for j in zero_bit: ans -= (1 << j) * num[j] current_node = current_node * 2 + (1 - y) else: current_node = current_node * 2 + aa #if a == 1: # print(ST.data[current_node]) ans -= a #print(a, ans) print(ans // 2) if __name__ == '__main__': main()