#include <bits/stdc++.h>
#include <atcoder/all>
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}

ll solve(){
    int N;cin >> N;
    ll mod;cin >> mod;
    ll A[N][N];
    rep(i,0,N){
        rep(j,0,N){
            cin >> A[i][j];
        }
    }
    if(mod>2){
        return 0;
    }
    rep(i,0,N){
        int cnt=0;
        rep(j,0,N){
            if(A[i][j]==-1){
                cnt++;
            }
        }
        if(cnt>1){
            return 0;
        }
    }
    rep(j,0,N){
        int cnt=0;
        rep(i,0,N){
            if(A[i][j]==-1){
                cnt++;
            }
        }
        if(cnt>1){
            return 0;
        }
    }
    rep(i,0,N){
        rep(j,0,N){
            if(A[i][j]==-1){
                A[i][j]=1;
            }
        }
    }
    rep(i,0,N){
        int k=i;
        while(k<N){
            if(A[k][i]==1){
                break;
            }
            k++;
        }
        if(k==N){
            return 0;
        }
        rep(j,0,N){
            swap(A[i][j],A[k][j]);
        }
        rep(k,i+1,N){
            if(A[k][i]==1){
                rep(j,0,N){
                    A[k][j]^=A[i][j];
                }
            }
        }
    }
    return 1;

}

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<ll> ans;
    int t;cin >> t;
    rep(i,0,t){
        ans.pb(solve());
    }
    rep(i,0,t){
        cout << ans[i] << endl;
    }

}