#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=1e5+5;
ll t, n, k, a[nx], sm;
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>t;
    while (t--)
    {
        cin>>n>>k;
        sm=0;
        for (int i=1; i<=n; i++) cin>>a[i], sm+=a[i];
        while ((sm%2)==0&&k>1)
        {
            sm=0;
            for (int i=1; i<=n; i++) a[i]/=2, sm+=a[i];
            k/=2;
        }
        if (k==1) cout<<(sm%2);
        else cout<<1;
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |