#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

long long a[N], b[60], m, f[60];

long long calc(int x, int y) {
    if (!~x) return 1;
    if (!y && ~f[x]) return f[x];
    long long res = 0;
    int L = ((m >> x) & 1);
    for (int i = 0; i <= (y ? L : 1); ++i) {
        if (~b[x] && i != b[x]) continue;
        res += calc(x - 1, y && (i == L));
    }
    if (!y) f[x] = res;
    return res;
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n;
        scanf("%d%lld", &n, &m);
        for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
        for (int i = 0; i < m; ++i) b[i] = -1;
        int fl = 1;
        for (int i = 1; i < n; ++i) {
            if (a[i] == a[i + 1]) continue;
            for (int j = 59; ~j; --j) {
                if (((a[i] ^ a[i + 1]) >> j) & 1) {
                    if ((a[i] >> j) & 1) {
                        fl &= (b[j] != 0), b[j] = 1;
                    } else {
                        fl &= (b[j] != 1), b[j] = 0;
                    }
                    break;
                }
            }
        }
        memset(f, -1, sizeof(f));
        printf("%lld\n", calc(59, 1));
    }
    return 0;
}