#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

void testcase(){
    int N, P; cin >> N >> P;
    if(P != 2){
        rep(i,N) rep(j,N){ int t; cin >> t; }
        cout << "0\n";
        return;
    }
    vector<int> wild_rows;
    vector<int> wild_cols;
    vector<i64> A(N);
    rep(i,N){
        rep(j,N){
            int t; cin >> t;
            if(t == 1) A[i] |= 1ll << j;
            if(t == -1){
                wild_rows.push_back(i);
                wild_cols.push_back(j);
            }
        }
    }
    sort(wild_rows.begin(), wild_rows.end());
    sort(wild_cols.begin(), wild_cols.end());
    rep(i,wild_rows.size()) if(i != 0){
        if(wild_rows[i-1] == wild_rows[i]){ cout << "0\n"; return; }
        if(wild_cols[i-1] == wild_cols[i]){ cout << "0\n"; return; }
    }
    rep(j,N) for(int i : wild_rows) A[i] &= ~(1ll << j);
    rep(i,N) for(int j : wild_cols) A[i] &= ~(1ll << j);
    int rankA = N - wild_rows.size();
    rep(s,N){
        sort(A.begin() + s, A.end());
        reverse(A.begin() + s, A.end());
        for(int t=s+1; t<N; t++){
            if((A[t] ^ A[s]) < A[t]) A[t] ^= A[s];
        }
        if(A[s] == 0){ rankA = s; break; }
    }
    if(rankA + (int)wild_rows.size() == N) cout << "1\n"; else cout << "0\n";
}

int main(){
    int T; cin >> T;
    while(T--) testcase();
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;