#include<bits/stdc++.h>
using namespace std;
long long xorPairCount(int arr[], int n, int x)
{
    long long result = 0; // Initialize result

    // create empty map that stores counts of
    // individual elements of array.
    unordered_map<int, int> m;

    for (int i=0; i<n ; i++)
    {
        int curr_xor =  x^arr[i];

        // If there exist an element in map m
        // with XOR equals to x^arr[i], that means
        // there exist an element such that the
        // XOR of element with arr[i] is equal to
        // x, then increment count.
        if (m.find(curr_xor) != m.end())
            result += m[curr_xor];

        // Increment count of current element
        m[arr[i]]++;
    }


    // return total count of pairs with XOR equal to x
    return result;
}
int main()
{

freopen("xor.in","r",stdin);
freopen("xor.out","w",stdout);
int n = 0, k = 0;
cin >> n >> k;

int arr[n];

for (int i = 0; i < n; i++) {
    cin>>arr[i];
}
/*
int map_[1<<18];
for(int i = 0; i < (1<<18); i++){
    map_[i] = 0;
}
int ans = 0;
for (int i = 0; i < n; i++) {
    ans += map_[arr[i] ^ k];
    map_[arr[i]]++;
}
*/
cout<<xorPairCount(arr, n, k)<<endl;
return 0;
}