#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<math.h>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
using namespace std;

#define official

#ifdef official
#define cin inF
#define cout outF
#endif

ifstream inF("xor.in");
ofstream outF("xor.out");

const int MAX_N=400100;
int n,k,a[MAX_N];
long long ans=0;
long long x[MAX_N];

void input()
{
    cin>>n>>k;
    for (int i=0;i<n;++i)
    {
        cin>>a[i];
    }
}
void output()
{
    cout<<ans<<'\n';
}

void solve()
{
    for (int i=0;i<n;++i)
    {
        ans+=x[a[i]^k];
        ++x[a[i]];
    }
}

int main()
{
    input();
    solve();
    output();

    return 0;
}