#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;


int64_t solve(int n, int64_t x, const vector<int64_t> & a) {
    int64_t ans = 0;
    map<int64_t, int> cnt;
    for (int64_t a_i : a) {
        if (cnt.count(a_i ^ x)) {
            ans += cnt[a_i ^ x];
        }
        ++ cnt[a_i];
    }
    return ans;
}

// generated by online-judge-template-generator v4.1.1 (https://github.com/kmyk/online-judge-template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int64_t N;
    int64_t X;
    cin >> N;
    vector<int64_t> A(N);
    cin >> X;
    REP (i, N) {
        cin >> A[i];
    }
    auto ans = solve(N, X, A);
    cout << ans << endl;
    return 0;
}