//---------- begin union_find ----------
pub struct DSU {
    p: Vec<i32>,
}
impl DSU {
    pub fn new(n: usize) -> DSU {
        assert!(n < std::i32::MAX as usize);
        DSU { p: vec![-1; n] }
    }
    pub fn init(&mut self) {
        self.p.iter_mut().for_each(|p| *p = -1);
    }
    pub fn root(&self, mut x: usize) -> usize {
        assert!(x < self.p.len());
        while self.p[x] >= 0 {
            x = self.p[x] as usize;
        }
        x
    }
    pub fn same(&self, x: usize, y: usize) -> bool {
        assert!(x < self.p.len() && y < self.p.len());
        self.root(x) == self.root(y)
    }
    pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> {
        assert!(x < self.p.len() && y < self.p.len());
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y {
            return None;
        }
        if self.p[x] > self.p[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.p[x] += self.p[y];
        self.p[y] = x as i32;
        Some((x, y))
    }
    pub fn parent(&self, x: usize) -> Option<usize> {
        assert!(x < self.p.len());
        let p = self.p[x];
        if p >= 0 {
            Some(p as usize)
        } else {
            None
        }
    }
    pub fn sum<F>(&self, mut x: usize, mut f: F) -> usize
    where F: FnMut(usize),
    {
        while let Some(p) = self.parent(x) {
            f(x);
            x = p;
        }
        x
    }
    pub fn size(&self, x: usize) -> usize {
        assert!(x < self.p.len());
        let r = self.root(x);
        (-self.p[r]) as usize
    }
}
//---------- end union_find ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        d: usize,
        e: [bytes; n],
    }
    let mut dsu = DSU::new(2 * n);
    let w = std::mem::size_of::<usize>();
    let c = (n + w - 1) / w;
    let mut g = vec![0usize; n * c];
    for (j, (e, g)) in e.iter().zip(g.chunks_mut(c)).enumerate() {
        for (i, e) in e.iter().enumerate() {
            if *e == b'1' {
                g[i / w] |= 1 << (i % w);
                dsu.unite(i, j + n);
                dsu.unite(j, i + n);
            }
        }
    }
    if (0..n).any(|a| !dsu.same(a, a + n)) {
        println!("No");
        return;
    }
    let mut buf = vec![];
    let mut mul = |a: &[usize], b: &[usize]| -> Vec<usize> {
        buf.clear();
        buf.resize(c * n, 0usize);
        let mut res = vec![0usize; c * n];
        for (i, b) in b.chunks(c).enumerate() {
            for j in 0..n {
                let x = b[j / w] >> (j % w) & 1;
                buf[j * c + i / w] |= x << (i % w);
            }
        }
        for (a, res) in a.chunks(c).zip(res.chunks_mut(c)) {
            for (k, b) in b.chunks(c).enumerate() {
                if a[k / w] >> (k % w) & 1 == 1 {
                    for (res, b) in res.iter_mut().zip(b.iter()) {
                        *res |= *b;
                    }
                }
            }
        }
        res
    };
    let mut t = vec![0usize; c * n];
    for i in 0..n {
        t[i * c + i / w] |= 1 << (i % w);
    }
    let mut d = if d % 2 == 0 {
        d.min(2 * n)
    } else {
        d.min(2 * n + 1)
    };
    let mut s = g;
    while d > 0 {
        if d & 1 == 1 {
            t = mul(&t, &s);
        }
        s = mul(&s, &s);
        d >>= 1;
    }
    for i in 0..n {
        for j in 0..n {
            if t[i * c + j / w] >> (j % w) & 1 == 0 {
                println!("No");
                return;
            }
        }
    }
    println!("Yes");
}

fn main() {
    run();
}