// #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 endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second
const int N = 3e5 + 5, M = 1e9 + 7, LG = 30;
int n , A[N] , k;
void solve(){
cin >> n >> k;
int su = 0;
for (int i=1 ; i<=n ; i++){
cin >> A[i];
su += A[i];
}
if (su&1){
cout << 1;
return;
}
for (int j=0 ; j<LG ; j++){
if (su&1){
cout << 1;
return;
}
if (k==1 || su == 0){
cout << 0;
return;
}
su = 0;
k = k/2;
for (int i=1 ; i<=n ; i++){
A[i] /= 2;
su += A[i];
}
}
}
signed main(){
// freopen("" , "r" , stdin);
// freopen("" , "w" , stdout);
// cout << setprecision(30);
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ts = 1;
cin >> ts;
while(ts--){
solve();
}
}
