#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}



using mint =ll;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;

/*

vector<ll> fact, factinv, inv;
const ll mod = 1e9 + 7;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
        inv[i] = ((mod - ((inv[mod % i] * (mod / i))) % mod) + mod) % mod;
        factinv[i] = (factinv[i - 1] * inv[i]) % mod;
    }
}
ll nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k]) % mod)) % mod;
}

*/

bool DEBUG = 0;


const ll mod=2;
ll inva(ll N) {
    ll a = N, b = mod, c = 1, d = 0;
    while (b > 0) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        c -= t * d;
        swap(c, d);
    }
    c %= mod;
    if (c < 0)c += mod;
    return c;
}

ll swaptimes = 0;
void qtrimatrix(vvll& D) {
    ll N = D.size();
    for (int i = 0; i < N; i++) {
        for (ll j = i; j < N; j++) {
            if (D[j][i] != 0) {
                swap(D[i], D[j]);
                if (i != j)swaptimes = 1 - swaptimes;
                break;
            }
        }

        for (ll j = i + 1; j < N; j++) {
            if (D[i][i] == 0)continue;
            ll d = inva(D[i][i]);
            d *= D[j][i];
            d %= mod;
            for (ll k = N-1; k>=i; k--) {
                D[j][k] -= (D[i][k] * d) % mod;
                D[j][k] += mod;
                D[j][k] %= mod;
            }
        }
    }
    return;
}

ll detmatrix(vvll& D) {
    qtrimatrix(D);
    ll N = D.size();
    ll res = 1;
    for (int i = 0; i < N; i++) {
        res = (res * D[i][i]) % mod;
    }
    if (swaptimes == 1) {
        res *= -1;
        res += mod;
    }
    return res;
}


int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll T;
    cin >> T;
    rep(t, T) {
        ll N, P;
        cin >> N >> P;
        
        ll S = (P == 2 ? 1 : 0);
        //mint::set_mod(P);
        vvm A(N, vm(N));
        vll D(N, 0), E(N, 0);
        bool OK = 1;
        vvll AA(N, vll(N,0));
        rep(i, N)rep(j, N) {
            ll a;
            cin >> a;
            if (a == -1){
                AA[i][j] = 1;
                A[i][j]=S;
                D[i]++;
                E[j]++;

                if(D[i]>1||E[j]>1)OK=0;
            }
            else{
                A[i][j] = a;
            }
        }
        
        if(!OK||P!=2){
            cout<<0<<endl;
            continue;
        }
        cout<<detmatrix(A)<<endl;
    }
}