#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 100024;

int a[MAX_N];

int cnt[2 * MAX_N];

int main() {
    freopen("xor.in","r",stdin);
    freopen("xor.out","w",stdout);

    int n, k;
    cin >> n >> k;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
        cnt[a[i]]++;
    }

    long long ans = 0;

    for (int i = 0; i < n; i++) {
        int t = k ^ a[i];

        if (t == a[i]) ans += cnt[a[i]] - 1;
        else ans += cnt[t];

    }

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