def det(M, mod):
	M = [row[:] for row in M]
	N, sign, prev = len(M), 1, 1
	for i in range(N-1):
		#print(*M, sep="\n")
		#print()
		if M[i][i] == 0:
			swapto = next((j for j in range(i+1, N) if M[j][i] != 0), None)
			if swapto is None:
				return 0
			M[i], M[swapto], sign = M[swapto], M[i], -sign
		previnv = pow(prev, mod-2, mod)
		for j in range(i+1, N):
			for k in range(i+1, N):
				M[j][k] = (M[j][k]*M[i][i]%mod-M[j][i]*M[i][k]%mod)*previnv%mod
		prev = M[i][i]
	return sign*M[-1][-1]%mod


T = int(input())
for _ in range(T):
	n, p = map(int,input().split())
	a = [list(map(int,input().split())) for i in range(n)]
	if p > 2:
		print(0)
		continue
	# p = 2
	x = [0] * n
	y = [0] * n
	for i in range(n):
		for j in range(n):
			if a[i][j] == -1:
				x[i] += 1
				y[j] += 1
	
	mode = 1
	for i in range(n):
		if x[i] > 1 or y[i] > 1:
			mode = 0
			break
	if mode == 0:
		print(0)
		continue
	
	bx = []
	by = []
	for i in range(n):
		if x[i] == 0:
			bx.append(x[i])
		if y[i] == 0:
			by.append(y[i])

	m = len(bx)
	b = [[a[bx[i]][by[j]] for j in range(m)]for i in range(m)]
	
	if len(b) > 0:
		print(det(b, 2))
	else:
		print(1)