#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n, m; cin >> n >> m;
  vector<int> a(n); REP(i, n) cin >> a[i];
  if (n > m) {
    // (a + b)^2 \equiv a + b (mod 2)
    vector<int> b(m + 1, 0);
    REP(i, m + 1) REP(j, n - m) {
      if (a[i + j] % 2 == 1) b[i] ^= (((n - m - 1) & j) == j);
    }
    a.swap(b);
    n = m + 1;
  }
  for (; n > 1; --n) {
    vector<int> b(n - 1);
    REP(i, n - 1) b[i] = ll{a[i] + a[i + 1]} * (a[i] + a[i + 1]) % (1 << m);
    a.swap(b);
  }
  cout << a.front() << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}