#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
void Gauss(vector<vector<mint>> &A){
	if(A.size()==0)return;
	int last = 0;
	rep(i,A[0].size()){
		int ind = -1;
		for(int j=last;j<A.size();j++){
			if(A[j][i]!=0){
				ind = j;
				break;
			}
		}
		if(ind==-1)continue;
		swap(A[last],A[ind]);
		
		mint x = A[last][i].inv();
		rep(j,A[last].size())A[last][j] *= x;
		
		rep(j,A.size()){
			if(j==last)continue;
			x = A[j][i];
			if(x==0)continue;
			rep(k,A[j].size()){
				A[j][k] -= A[last][k] * x;
			}
		}
		
		last++;
	}
}

int main(){
	
	int _t;
	cin>>_t;
	rep(_,_t){
		int N,P;
		cin>>N>>P;
		mint::set_mod(P);
		
		vector<vector<int>> a(N,vector<int>(N));
		rep(i,N){
			rep(j,N){
				cin>>a[i][j];
			}
		}
		
		if(P!=2){
			cout<<0<<endl;
		}
		else{
			vector<int> xs(N),ys(N);
			bool f = true;
			int c = 0;
			rep(i,N){
				rep(j,N){
					if(a[i][j]==-1){
						if(xs[i]||ys[j])f = false;
						xs[i] = 1;
						ys[j] = 1;
						c++;
					}
				}
			}
			if(!f){
				cout<<0<<endl;
				continue;
			}
			vector<vector<mint>> b(N-c,vector<mint>(N-c));
			int ii = 0;
			rep(i,N){
				if(xs[i])continue;
				int jj = 0;
				rep(j,N){
					if(ys[j])continue;
					b[ii][jj] = a[i][j];
					jj++;
				}
				ii++;
			}
			Gauss(b);
			if(b.size()!=N-c)cout<<0<<endl;
			else{
				mint ans = 1;
				rep(i,N-c)ans *= b[i][i];
				cout<<ans.val()<<endl;
			}
		}
		
	}
	
	return 0;
}