#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unordered_multiset<ll> whydoweneedunorderedmultiset;
#define ff first
#define ss second
#define esle else
ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 9;
ll l, r, k, n, m;
ll a[1000007];
string ans = "";
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> ttt;
while (ttt--) {
cin >> n >> k;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (k == 1) {
ans += (sum % 2 == 0 ? '0' : '1');
}
}
cout << ans << endl;
return 0;
}
