#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n, p; cin >> n >> p;
		vector<vector<int>>a(n, vector<int>(n));
		rep(i, n)rep(j, n)cin >> a[i][j];
		if (p >= 3) {
			cout << 0 << endl;
			continue;
		}
		bool chk = true;
		rep(i, n) {
			int cnt = 0;
			rep(j, n)if (-1 == a[i][j])cnt++;
			if (cnt > 1)chk = false;
		}
		rep(i, n) {
			int cnt = 0;
			rep(j, n)if (-1 == a[j][i])cnt++;
			if (cnt > 1)chk = false;
		}
		if (!chk) {
			cout << 0 << endl;
			continue;
		}
		int cnt = 0;
		rep(i, n)rep(j, n)if (-1 == a[i][j])cnt++;
		if (cnt >= n) {
			cout << 1 << endl;
			continue;
		}
		vector<vector<int>>v;
		rep(i, n) {
			vector<int>tmp;
			rep(j, n) {
				bool chk = true;
				rep(k, n)if (-1 == a[i][k])chk = false;
				rep(k, n)if (-1 == a[k][j])chk = false;
				if (chk)tmp.push_back(a[i][j]);
			}
			if (!tmp.empty())v.push_back(tmp);
		}
		if (v.size()) {
			int sz = v.size();
			vector<long long>vec(sz);
			rep(i, sz) {
				rep(j, sz) {
					vec[i] *= 2;
					vec[i] += v[i][j];
				}
			}
			vector<long long>base;
			rep(i, sz) {
				long long a = vec[i];
				for (int j = 0; j < base.size(); ++j) {
					a = min(a, a^base[j]);
				}
				if (a == 0) continue;
				for (int j = 0; j < base.size(); ++j) {
					base[j] = min(base[j], a^base[j]);
				}
				base.push_back(a);
			}
			if (sz == base.size())cout << 1 << endl;
			else cout << 0 << endl;
		}
		else {
			cout << 0 << endl;
		}
	}
	return 0;
}