// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1e9+7;
const int inf = 1e14;
const int LOG=17;
const int N=1e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve(){
cin >> n >> k;
int s=0;
vector<int>a(n);
for (int i=0;i<n;i++){
cin >> a[i];
s+=a[i];
}
sort(a.begin(),a.end());
if (s%2){
cout << 1;
return;
}
if (k==1){
cout << 0;
return;
}
while (s){
k/=2;
s=0;
for (int i=0;i<n;i++){
a[i]/=2;
s+=a[i];
}
if (s%2){
cout << 1;
return;
}
if (k==1){
cout << 0;
return;
}
}
cout << 0;
}
signed main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r" ,stdin);
// freopen("output.txt","w",stdout);
// #endif
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
srand(time(0));
// int t=1;
cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
cout << endl;
}
