#include <bits/stdc++.h>

using namespace std;
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define int long long
#define ll long long
#define ld long double

#define rep(i, n) for (ll i=0; i<n; i++)
#define repi(i, n) for (ll i=1; i<=n; i++)

#define repi1(i, n) for (ll i = n; i >=0; i--)
#define mem(v, ha) memset(v, ha, sizeof(v))
#define all(a)  a.begin(), a.end()
#define allr(a)  a.rbegin(), a.rend()
#define CLOCK cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
typedef vector<ll> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<ll, ll>> vpi;
typedef vector<char> vc;
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define mp make_pair
#define ff first
#define ss second
const ll mod = 1e9 + 7;
//const ll mod = 998244353 ;

const long double PI = 3.141592653589793238460;
const int inf = (int)(1e9);

template<typename T> istream& operator>>(istream& in, vector<T>& a) {for (auto &x : a) in >> x; return in;};
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for (auto &x : a) out << x << ' '; return out;};



// auto sum=[&](int use, int y){return use+y;};
// function <void(int)>dfs=[&](int u)
//void is the return type, int is the argumen

const int N = 2e5 + 5;
// int s[N];
// vector<int> g[N];


void solve()
{
	int n, x;
	cin >> n >> x;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	map<int, int> mp;
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		ans += mp[a[i] ^ x];
		mp[a[i]]++;
	}
	cout << ans << endl;

}

int32_t main()
{

	int T = 1;

	// cin >> T;


	while (T--)
	{
		solve();


	}

}