#include <bits/stdc++.h>
using namespace std;
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int N, P;
    cin >> N >> P;
    vector<vector<int>> A(N, vector<int>(N));
    for (int j = 0; j < N; j++){
      for (int k = 0; k < N; k++){
        cin >> A[j][k];
      }
    }
    if (P >= 3){
      cout << 0 << endl;
    } else {
      bool ok = true;
      vector<bool> B(N, false), C(N, false);
      for (int j = 0; j < N; j++){
        for (int k = 0; k < N; k++){
          if (A[j][k] == -1){
            if (B[j]){
              ok = false;
            }
            B[j] = true;
            if (C[k]){
              ok = false;
            }
            C[k] = true;
          }
        }
      }
      if (!ok){
        cout << 0 << endl;
      } else {
        for (int j = 0; j < N; j++){
          for (int k = 0; k < N; k++){
            if (A[j][k] == 1 && (B[j] || C[k])){
              A[j][k] = 0;
            }
            if (A[j][k] == -1){
              A[j][k] = 1;
            }
          }
        }
        int ans = 1;
        for (int j = 0; j < N; j++){
          int p = -1;
          for (int k = j; k < N; k++){
            if (A[k][j] == 1){
              p = k;
            }
          }
          if (p == -1){
            ans = 0;
            break;
          }
          swap(A[j], A[p]);
          for (int k = 0; k < N; k++){
            if (k != j && A[k][j]){
              for (int l = j + 1; l < N; l++){
                if (A[j][l]){
                  A[k][l] = 1 - A[k][l];
                }
              }
            }
          }
        }
        cout << ans << endl;
      }
    }
  }
}