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

#define int long long  

void solve() {
	int n, k;
	cin >> n >> k;

	array<int, 60> a, b;
	a.fill(-1);
	b.fill(0);

	bool ok = true;
	int lst = 0;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		if (i != 1) {
			for (int j = 60; j >= 0; j--) {
				if ((x >> j & 1) == (lst >> j) & 1) {
					continue;
				}
				if (x >> j & 1) {
					if (a[j] == 1) {
						ok = false;
					}
					a[j] = 0;
				} else {
					if (a[j] == 0) {
						ok = false;
					}
					a[j] = 1;
				}
				break;
			}
		}
		lst = x;
	}

	if (!ok) {
		cout << 0 << "\n";
		return;
	}

	for (int i = 0; i < 60; i++) {
		if (a[i] != -1) {
			b[i] = 1;
		}
		if (i) {
			b[i] += b[i - 1];
		}
	}

	// for (int i = 0; i < 5; i++) {
	// 	cout << a[i] << " ";
	// }
	// cout << "\n";
	// for (int i = 0; i < 5; i++) {
	// 	cout << b[i] << " ";
	// }
	// cout << "\n";
	
	array<int, 60> ans;
	ans.fill(-1);
	auto dfs = [&](auto self, int d, bool flg) -> int {
		// cout << d << " " << flg << "\n";
		if (d == -1) {
			return 1;
		}
		if (!flg) {
			return 1LL << (d + 1 - b[d]);
		}
		if (ans[d] != -1) {
			return ans[d];
		}
		int ret = 0;
		if (a[d] != 0 && (k >> d & 1)) {
			ret += self(self, d - 1, true);
		}
		if (a[d] != 1) {
			if (k >> d & 1) {
				ret += self(self, d - 1, false);
			} else {
				ret += self(self, d - 1, true);
			}
		}
		return ans[d] = ret;
	};

	cout << dfs(dfs, 59, true) << "\n";
}

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

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}