#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 



int main(void){
    int n;
    ll x;
    cin>>n>>x;
    vector<ll>a(n);
     map<ll,ll>mp;
    for(int i=0;i<n;i++){
        cin>>a[i];
        mp[a[i]]++;
    }
    ll ans = 0;
    for(int i=0;i<n;i++){
        if(x==0){
            ans+= (mp[a[i]]*(mp[a[i]]-1))/2;
            mp[a[i]]=0;
        }
        else{
            ans+=mp[a[i]]*mp[x^a[i]];
            mp[a[i]]=0;
            mp[a[i]^x]=0;
        }
    }
    cout<<ans<<endl;
    return 0;
}