def naive(n,m,a):
  mod=1<<m
  for _ in range(n-1):
    b=[]
    for i in range(len(a)-1):
      b.append((a[i]+a[i+1])**2)
    a=[i%mod for i in b]
  return a[0]

def solve(n,m,a):
  if n<=m:
    return naive(n,m,a)
  b=[0]*m
  for i in range(m):
    for j in range(n-m+1):
      b[i]+=a[i+j]%2*((n-m)&j==j)
      b[i]&=1
  return naive(m,m,b)

for _ in range(int(input())):
  n,m=map(int,input().split())
  a=list(map(int,input().split()))
  print(solve(n,m,a))