#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, x;
    cin >> n >> x;

    map<ll,ll> mp;
    ll a[n];
    rep(i,n){
        cin >> a[i];
        mp[a[i]]++;
    }

    ll ans = 0;

    if(x == 0){
        rep(i,n){
            ll cnt = mp[a[i]];
            ans += cnt * (cnt-1) / 2;
            mp[a[i]] = 1;
        }
            
    }else{
        rep(i,n){
            ll y = x ^ a[i];
            ans += mp[y];
        }
        ans /= 2;
    }

    cout << ans << endl;
    return 0;
}