#include<bits/stdc++.h>
using namespace std;
using i64=long long;

i64 solve_sub(vector<i64> A,int M){
  while(A.size()>1){
    vector<i64> B(A.size()-1);
    for(int i=0;i<A.size()-1;++i){
      B[i]=(A[i]+A[i+1])*(A[i]+A[i+1])%(1ll<<M);
    }
    A=B;
  }
  return A[0];
}

void solve(){
  int N,M;
  scanf("%d%d",&N,&M);
  vector<i64> A(N);
  for(auto& v:A){ scanf("%lld",&v); }
  if(N>=60){
    vector<i64> B(60);
    for(int k=0;k<60;++k){
      for(int i=0;i<N-59;++i){
        B[k]^=A[i+k]%2*(((N-60)&i)==i?1:0);
      }
    }
    A=B;
  }
  printf("%d\n",int(solve_sub(A,M)));
}

int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
}