#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::Read;

#[allow(dead_code)]
fn getline() -> String {
    let mut ret = String::new();
    std::io::stdin().read_line(&mut ret).ok().unwrap();
    ret
}

fn get_word() -> String {
    let stdin = std::io::stdin();
    let mut stdin=stdin.lock();
    let mut u8b: [u8; 1] = [0];
    loop {
        let mut buf: Vec<u8> = Vec::with_capacity(16);
        loop {
            let res = stdin.read(&mut u8b);
            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                break;
            } else {
                buf.push(u8b[0]);
            }
        }
        if buf.len() >= 1 {
            let ret = String::from_utf8(buf).unwrap();
            return ret;
        }
    }
}

#[allow(dead_code)]
fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn solve() {
    let t: usize = get();
    for _ in 0..t {
        let n: usize = get();
        let p: i32 = get();
        let mut a = vec![vec![0; n]; n];
        for i in 0..n {
            for j in 0..n {
                a[i][j] = get();
            }
        }
        if p != 2 {
            println!("0");
            continue;
        }
        let mut row = vec![0; n];
        let mut col = vec![0; n];
        for i in 0..n {
            for j in 0..n {
                if a[i][j] == -1 {
                    row[i] += 1;
                    col[j] += 1;
                }
            }
        }
        if row.iter().any(|&v| v >= 2) || col.iter().any(|&v| v >= 2) {
            println!("0");
            continue;
        }
        let mut sub = vec![];
        for i in 0..n {
            if row[i] >= 1 { continue; }
            let mut tmp = 0i64;
            for j in 0..n {
                if col[j] == 0 {
                    if a[i][j] == 1 {
                        tmp |= 1 << j;
                    }
                }
            }
            sub.push(tmp);
        }
        let mut basis = vec![];
        for &(mut s) in &sub {
            for &b in &basis {
                s = min(s, s ^ b);
            }
            if s != 0 {
                basis.push(s);
            }
        }
        println!("{}", if basis.len() == sub.len() { 1 } else { 0 });
    }
}