/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 1
int n, m, k, ans, res, a[N], pos[N];
/*
5 2
2 2 1 1 1
*/
void solve(int t_case){
cin>>n>>k;
if(k == 2){
priority_queue<int> ss;
int sum = 0;
for(int i=0;i<n;i++){
cin>>a[i], a[i] %= 4;
sum += a[i];
if(a[i] > 1) ss.push(a[i]);
}
while(!ss.empty() && !(sum&1)){
int cur = ss.top(); ss.pop();
sum -= (cur - 2);
}
cout<<(sum&1);
} else {
int sum = 0;
for(int i=0;i<n;i++) cin>>a[i], sum += a[i];
cout<<(sum & 1);
}
}
signed main(){
NeedForSpeed
if(!MULTI) {
solve(1);
} else {
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
}
return 0;
}
