T=int(input())

def rep_mul(a,x,m):
	t=0
	val=a
	while t<x:
		if val==0 or val==1:
			return val
		val*=a
		val%=m
		t+=1
	return val
	
def process(A,m):
	N=len(A)
	if N==1:
		return A[0]
	B=[(A[i]+A[i+1])**2%m for i in range(N-1)]
	return process(B,m)

def find_min_2x(N):
	return 1<<(len(bin(N))-3)
	

def solve():
	L,M=map(int,input().split())
	A=[int(x) for x in input().split()]
	m=1<<M
	while L>50:
		X = find_min_2x(L-40)
		A=[rep_mul(A[i],X,m)+rep_mul(A[i+X],X,m) for i in range(L-X)]
		L=len(A)

	print(process(A,m))
for _ in range(T):
	solve()