#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,X;
map<int,int> M;

void solve() {
    cin>>N>>X;
    int a;
    REP(i,N) {
        cin>>a;
        M[a]++;
    }
    int ans = 0;
    bitset<32> bx(X);
    for (auto p:M) {
        bitset<32> a0(p.first),a1;
        REP(i,33) {
            if (a0[i] && !bx[i]) a1[i]=1;
            if (!a0[i] && bx[i]) a1[i]=1;
            if (a0[i] && bx[i]) a1[i]=0;
            if (!a0[i] && !bx[i]) a1[i]=0;
        }
        ans += M[(int)(a1.to_ulong())] * p.second;
    }
    cout << ans/2 << endl;
}