#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    ll N, X;
    cin >> N >> X;
    map<ll, ll> mp;
    rep(i, N) {
        ll a;
        cin >> a;
        mp[a]++;
    }
    ll res = 0;
    for(auto p : mp) {
        ll t = X ^ p.first;
        if(X == 0) {
            res += p.second * (p.second - 1);
        } else
            res += p.second * mp[t];
    }
    cout << res / 2 << endl;
    return 0;
}