#include #include using namespace std; using namespace atcoder; using mint = modint; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { int n, p; cin >> n >> p; mint::set_mod(p); vector a(n, vector(n)); vector row(n), col(n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int u; cin >> u; row[i] += (u == -1); col[j] += (u == -1); a[i][j] = u; } } int mir = *min_element(row.begin(), row.end()), mxr = *max_element(row.begin(), row.end()), mic = *min_element(col.begin(), col.end()), mxc = *max_element(col.begin(), col.end()); if (mir == 0 && mxr == 0) { mint ans = 1; for (int i = 0; i < n; i++) { for (int j = i; j < n; j++) { if (a[j][i] != 0) { swap(a[i], a[j]); break; } } if ((ans *= a[i][i]) == 0) { break; } for (int j = i + 1; j < n; j++) { mint d = a[j][i] / a[i][i]; for (int k = i; k < n; i++) { a[j][k] -= a[i][k] * d; } } } cout << ans.val() << '\n'; } else if (mir == 1 && mxr == 1 && mic == 1 && mxc == 1 && p == 2) { cout << "1\n"; } else { cout << "0\n"; } } }