#include<iostream>
#include<cstdio>
using namespace std;
const int maxx = 100000;
long long  kolko[maxx+50], A[maxx+50];
long long  otg =0;
int main()
{
     freopen ("xor.in", "r", stdin); freopen
    ("xor.out", "w" , stdout);

    long long n,k;
    cin>>n>>k;
    for(int i=0;i<n;i++)
    {
        cin>>A[i];
        kolko[A[i]]++;
    }
    for(int i=0;i<n;i++)
    {
        long long x = A[i]^k;
        if(x <= maxx)
        otg += kolko[x];
    }
    if(k == 0)
        otg -= n;
    cout<<otg/2<<endl;

    return 0;

}