# これは正式な Validation ではありません(あとでもっと厳密なやつをやる)

def solve(n, p, a):
	if p > 2:
		return 0
	
	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:
		return 0

	bx = []
	by = []
	for i in range(n):
		if x[i] == 0:
			bx.append(i)
		if y[i] == 0:
			by.append(i)

	m = len(bx)
	b = [0] * m
	for i in range(m):
		for j in range(m):
			b[i] ^= a[bx[i]][by[j]] << j
	
	base = []
	for v in b:
		for e in base:
			v = min(v, v^e)
		if v > 0: base.append(v)
	
	if len(base) == m:
		return 1
	else:
		return 0

def isprime(n):
	if n == 1:
		return False
	for i in range(2, int(n**0.5)+1):
		if n % i == 0:
			return False
	return True


T = int(input())
assert 1 <= T <= 100
for i in range(T):
	n, p = map(int,input().split())
	assert 2 <= n <= 50
	assert 2 <= p < 10 ** 9
	assert isprime(p)
	a = [list(map(int,input().split())) for j in range(n)]
	mode = 0
	for i in range(n):
		for j in range(n):
			assert -1 <= a[i][j] < p
			if a[i][j] == -1:
				mode = 1
	assert mode == 1
	print(solve(n,p,a))