#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  long long X;
  cin >> X;
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  map<long long, int> cnt;
  long long ans = 0;
  for (int i = N - 1; i >= 0; i--){
    if (cnt.count(X ^ A[i])){
      ans += cnt[X ^ A[i]];
    }
    cnt[A[i]]++;
  }
  cout << ans << endl;
}