#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
ll n;
ll x;
vector<ll> a(n);

int main(){
    cin >> n >> x;
    a.resize(n);
    rep(i,n) cin >> a[i];
    sort(a.begin(),a.end());
    ll ans = 0;
    rep(i,n){
        ll now = a[i] ^ x;
        int target = upper_bound(a.begin(),a.end(),now) - lower_bound(a.begin(),a.end(),now);
        if(now == a[i]) ans += (ll)(target - 1);
        else ans += (ll)target;
        //cout << ans << endl;
    }
    cout << ans / 2 << endl;

    return 0;
}