#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

#define maxn 200005
#define maxlgn 62

int64_t a[maxn];
int choice[maxn];
int64_t suf[maxlgn];

void solve(int t, int l, int r) {
    if (t == -1 || l == r) return;
    int x = -1;
    for (int i = l; i < r; i++)
        if ((a[i] >> t & 1) ^ (a[i + 1] >> t & 1)) {
            if (~x) return choice[t] = 0, void();
            x = i;
        }
    if (!~x) return solve(t - 1, l, r);
    choice[t] &= (1 << (a[x] >> t & 1));
    return solve(t - 1, l, x), solve(t - 1, x + 1, r);
}

void solve(void) {
    int n;
    int64_t k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];

    for (int t = maxlgn - 1; ~t; t--) choice[t] = 3;
    solve(maxlgn - 1, 1, n);
    for (int i = 0; i < maxlgn; i++)
        if (!choice[i]) return cout << 0 << endl, void();

    suf[0] = 1;
    for (int i = 1; i < maxlgn; i++) suf[i] = suf[i - 1] * __builtin_popcount(choice[i - 1]);

    int64_t ans = 0;
    for (int i = maxlgn - 1; ~i; i--) {
        bool t = (k >> i & 1);
        if (t && (choice[i] & 1)) ans += suf[i];
        if (!(choice[i] >> t & 1)) break;
        if (!i) ans++;
    }

    cout << ans << endl;

    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int _ = 1;
    cin >> _;
    while (_--) solve();

    return 0;
}