#include <bits/stdc++.h>

using namespace std;
using LL = long long;

const int N = 2e5 + 10, M = 64;
LL a[N], f[M];
int d[M];

int dfs(LL k, int x, int lim) {
  if (x == -1) return 1;
  if (!lim && ~f[x]) return f[x];
  int up = !lim ? 1 : (k >> x & 1);
  LL ans = 0;
  for (int i = 0; i <= up; i++) {
    if (d[x] != -1 && i != d[x]) continue;
    (ans += dfs(k, x - 1, lim && i == up));
  }
  if (!lim) f[x] = ans;
  return ans;
} 

void solve() {
  int n;
  LL k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  memset(d, -1, sizeof d);
  for (int i = 1; i < n; i++) {
    for (int j = 63; j >= 0; j--) {
      if ((a[i] >> j & 1) ^ (a[i + 1] >> j & 1)) {
        if (a[i] >> j & 1) {
          if (d[j] == 0) {
            cout << 0 << '\n';
            return;
          }
          d[j] = 1;
        }
        else {
          if (d[j] == 1) {
            cout << 0 << '\n';
            return;
          }
          d[j] = 0;
        }
        break;
      }
    }
  }
  memset(f, -1, sizeof f);
  cout << dfs(k, 63, 1) << '\n';
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}