#include <bits/stdc++.h>
using namespace std;
long long int n, x, a[100005], ct[100005];
int main() {
  cin >> n >> x;
  for (long long int i = 1; i <= n; ++i) cin >> a[i], ct[a[i]]++;
  sort(a + 1, a + n + 1);
  long long int ans = 0;
  for (long long int i = 1; i <= n; ++i) {
    long long int ch = x ^ a[i];
    if (ch == a[i]) {
      ans += (ct[ch] - 1);
    } else if (ch <= 100000)
      ans += ct[ch];
  }
  cout << ans / 2;
}
