#include <bits/stdc++.h>

using namespace std;
#define int long long

inline void print(__int128 n) {
    if (n < 0) {
        putchar('-');
        n *= -1;
    }
    if (n > 9) print(n / 10);
    putchar(n % 10 + '0');
}


__int128 ans;
vector<int> pos(70, -1);

void dfs(int k, int p) {
    if (p == -1) {
        ans++;
        return;
    }

    if ((k >> p & 1ll) && pos[p] == -1) { //这位是1，那么可以选0，下一位开始任选
        __int128 t = 1;
        for (int i = p - 1; i >= 0; i--) {
            if (pos[i] == -1) {
                t *= 2ll;
            }
        }
        ans += t;
    } else if ((k >> p & 1) && pos[p] == 0) {
        __int128 t = 1;
        for (int i = p - 1; i >= 0; i--) {
            if (pos[i] == -1) {
                t *= 2ll;
            }
        }
        ans += t;
        return;
    } else if (!(k >> p & 1) && pos[p] == 1) {
        return;
    }
    // 这位是0，没得选，往下
    dfs(k, p - 1);
}

void solve() {
    int n, k;
    cin >> n >> k;
    ans = 0;
    vector<int> a(n + 1);

    for (int i = 1; i <= n; i++) cin >> a[i];

    // 相邻判断某位上是否一定为某数，如果冲突直接输出0
    // 最后考虑k的范围

    for (int i = 2; i <= n; i++) {
        for (int j = 63; j >= 0; j--) {
            if ((a[i] >> j & 1) != (a[i - 1] >> j & 1)) {
                if (pos[j] == -1) {
                    pos[j] = a[i - 1] >> j & 1;
                    break;
                } else if (pos[j] != (a[i - 1] >> j & 1)) {
                    cout << "0\n";
                    return;
                }
            }
        }
    }

    ans = 0;

    dfs(k, 63);

    print(ans);
    cout << "\n";
}

signed main() {
#ifdef ONLINE_JUDGE
#else
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}