#include <bits/stdc++.h>
using namespace std;
long long int a[100009], cnt[100009];
int bin_search(int beg, int end, long long int val) {
  int mid = (beg + end) / 2;
  while (beg <= end) {
    mid = (beg + end) / 2;
    if (a[mid] == val) {
      return mid;
    } else if (a[mid] < val) {
      beg = mid + 1;
    } else if (a[mid] > val) {
      end = mid - 1;
    }
  }
  return -1;
}
int main() {
  long long int n, x, k;
  cin >> n >> x;
  for (int i = (0); i <= (n - 1); i++) {
    cin >> a[i];
    cnt[a[i]]++;
  }
  sort(a, a + n);
  long long int sum = 0, j;
  if (x == 0) {
    for (int i = 0; i <= n - 2; i++) {
      sum += ((cnt[a[i]] - 1) * (cnt[a[i]])) / 2;
      while ((i < n - 2) && a[i] == a[i + 1]) {
        i++;
      }
    }
  } else {
    for (int i = 0; i <= n - 2; i++) {
      k = a[i] ^ x;
      j = bin_search(i + 1, n - 1, k);
      if (j != -1) {
        sum += cnt[a[j]] * cnt[a[i]];
      }
      while ((i < n - 2) && a[i] == a[i + 1]) {
        i++;
      }
    }
  }
  cout << sum << endl;
  return 0;
}
