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

using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i < (n); i++)

template<class T> istream& operator >> (istream& s, vector<T>& v)
{ for (T& x: v) { s >> x; } return s;}
template<class F, class S> istream& operator >> (istream& s, pair<F, S>& p)
{ s >> p.first >> p.second; return s;}

int main()
{
    int N, X; cin >> N >> X;
    map<int, int> m;
    rep(i, N) {
        int A; cin >> A;
        m[A]++;
    }
    ll ans = 0;
    set<int> done;
    for (const auto& p : m) {
        const int& A = p.first;
        const int& c = p.second;
        if (done.count(A) > 0) continue;
        int B = A^X;
        if (A == B) {
            ans += c * (c - 1) / 2;
        } else {
            if (m.count(B) > 0) {
                ans += c * m[B];
            }
        }
        done.insert(A);
        done.insert(B);
    }

    cout << ans << endl;
}