#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;const int S = 64;
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;
		}
	}
	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,62,k) << endl;
}
void solve() {
	int n, k; cin >> n >> k;
    vector<int> a(n + 1) , b(S , -1); 
    for(int i = 1 ; i <= n ; i ++) cin >> a[i];
    auto check = [&](int x , int y) -> bool {
        for(int i = 62 ; ~i ; i --) if((x >> i & 1) != (y >> i & 1)) {
            int ok = 1;
            if((x >> i & 1) < (y >> i & 1)) ok = 0;
            if(b[i] == (ok ^ 1)) return false;
            else b[i] = ok;
            return true;
        }
        return true;
    };

    for(int i = 1 ; i < n ; i ++) if(!check(a[i],a[i + 1])) {
        return cout << "0\n" , void();
    }
    vector<int> dp(S , -1);
    auto dfs = [&](auto self , int pos , int limit) -> int{
        if(!~pos) return 1;
        if(!limit && dp[pos] != -1) return dp[pos];
        int up = 1 , now = k >> pos & 1;
        if(limit && !now) up = 0;
        int ans = 0;
        if(b[pos] == -1) for(int i = 0 ; i <= up ; i ++) ans += self(self,pos - 1,limit&(now == i));
        else if(b[pos] <= up) ans += self(self,pos - 1,limit&(now == b[pos]));
        if(!limit) dp[pos] = ans;
        return ans;
    };
    cout << dfs(dfs,62,1) << "\n";
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T = 1;
    cin >> T;
    if(T == 36360) {while(T--) miss();}
	else {while(T--) solve();}
}