#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int N=200005,M=35;
int n,m;
unsigned a[N],b[N];

void ahcorz(){
    cin >> n >> m;
    for(int i=0; i<n; ++i) cin >> a[i];
    if(n>=M){
        for(int i=0; i<M; ++i){
            b[i]=0;
            for(int j=0; j<=n-M; ++j) if(((n-M)&j)==j) b[i]^=a[i+j]&1;
        }
        for(int i=0; i<M; ++i) a[i]=b[i];
        n=M;
    }
    for(int j=0; j<n-1; ++j){
        for(int i=0; i<n-j-1; ++i) b[i]=(a[i]+a[i+1])*(a[i]+a[i+1]);
        for(int i=0; i<n-j-1; ++i) a[i]=b[i];
    }
    cout << a[0]%(1<<m) << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t; cin >> t;
    while(t--) ahcorz();
}