#include <bits/stdc++.h>
using namespace std;
int main(void){
    // Your code here!
    int N, X;
    cin >> N >> X;
    vector<int> A(N);
    vector<int> B(N);
    int a;
    for (int i=0;i<N;i++){
        cin >> a;
        A[i] = a;
        for (int j=0;j<32;j++){
            B[i] += (1 << j) * (((a >> j) & 1) ^ ((X >> j) & 1));
        }
    }
    map<int, int> D;
    for (int i=0;i<N;i++){
        if (D.count(B[i])){
            D[B[i]] += 1;
        }
        else{
            D[B[i]] = 1;
        }
    }
    long long cnt = 0;
    int s = 0;
    for (int i=0;i<N;i++){
        if (D.count(A[i])){
            cnt += D[A[i]];
        }
        if (A[i] == B[i]){
            cnt -= 1;
        }
    }
    cout << cnt / 2 << endl;
    return 0;
}