#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool m2(long long n, long long k) {
	return (n&k) == k;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, m; cin >> n >> m;
		vector<long long>a(n);
		rep(i, n)cin >> a[i];
		if (n >= 60) {
			vector<long long>tmp(60);
			rep(i, 60) {
				rep(j, n - 59) {
					tmp[i] ^= a[i + j] * m2((n - 60), j);
				}
			}
			swap(a, tmp);
		}
		while (a.size() > 1) {
			vector<long long>tmp(a.size() - 1);
			rep(i, a.size() - 1) {
				tmp[i] = ((a[i] + a[i + 1]) * (a[i] + a[i + 1])) % (1LL << m);
			}
			swap(a, tmp);
		}
		cout << a[0] << endl;
	}
	return 0;
}