#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define x first
#define y second
const int mod = 1e9 + 7;
void miss() {
	int n,k;
	cin >> n >> k;
	vector<int>ai(n + 1),fg(66,-1);
	for(int i = 1; i <= n; i++) {
		cin >> ai[i];
	}
	auto check =[&] (int qwq,int qaq) -> bool {
		for(int i = 61; ~i; i--) {
			if((((qwq >> i) & 1) != ((qaq >> i) & 1))) {
				if((qwq >> i) & 1) {
					if(fg[i + 1] == 1) return 0;
					else fg[i + 1] = 0;
				}else {
					if(!fg[i + 1]) return 0;
					else fg[i + 1] = 1;
				}
				return 1;
			} 
		}
	};
	for(int i = 2; i <= n; i++) {
		if(!check(ai[i],ai[i - 1])) {
			cout << "0\n";
			return;
		}
	}
	int zlm = 1;
	for(int i = 62; i >= 0; i--) {
		if((1ll << i) <= k) {
			zlm = i + 3;
			break;
		}
	}
	if(zlm > 63) zlm = 63;
	auto dfs =[&] (auto self,int sum,int tot) -> int {
		if(tot < 0) return 0;
		if(!sum) return 1;
		int ans = 0;
		if(fg[sum] == -1) {
			ans += self(self,sum - 1,tot - (1ll << (sum - 1)));
			if(tot >= (1ll << (sum - 1))) {
				int x = 1;
				for(int i = sum - 1; i >= 1; i--) {
					if(fg[i] == -1) x <<= 1;
				}
				ans += x;
			}else ans += self(self,sum - 1,tot);
		}else if(fg[sum]) ans += self(self,sum - 1,tot - (1ll << (sum - 1)));
		else ans += self(self,sum - 1,tot);
		return ans;
	};
	cout << dfs(dfs,zlm,k) << endl;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T = 1;
    cin >> T;
	while(T--) miss();
}