import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


uint brute(const(uint[]) as) {
  const asLen = cast(int)(as.length);
  auto bs = as.dup;
  foreach_reverse (n; 1 .. asLen) {
    foreach (i; 0 .. n) {
      bs[i] = (bs[i] + bs[i + 1])^^2;
    }
    debug {
      writeln(bs[0 .. n]);
    }
  }
  return bs[0];
}

/*
  e >= 1
  x == x0, y == y0  (mod 2^e)
  (x + y)^2 == (x0 + y0)^2  (mod 2^(e+1)
*/
void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        const M = readInt;
        auto A = new uint[N];
        foreach (i; 0 .. N) {
          A[i] = readInt;
        }
        
        uint ans;
        if (N <= M) {
          ans = brute(A);
        } else {
          auto bs = new uint[M];
          foreach (i; 0 .. M) {
            foreach (j; 0 .. (N-M) + 1) {
              // binom(N-M, j)
              if (!(~(N-M) & j)) {
                bs[i] += A[i + j];
              }
            }
            bs[i] &= 1;
          }
          debug {
            writeln("bs = ", bs);
          }
          ans = brute(bs);
        }
        
        ans &= ((1U << M) - 1);
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}