import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) private val N = ni() private val D = nl() private val n = 3*N private val par = IntArray(n){it} private val rank = IntArray(n){1} // 集合の要素数 private val visits = IntArray(n) // 訪れた場所をfind毎に用意するのがもったいないのでつかいまわす fun init() { for (i in 0 until n) { par[i] = i } Arrays.fill(rank, 1) Arrays.fill(visits, 0) } private inline fun find(x: Int): Int { var ptr = 0 var i = x while(par[i] != i) { visits[ptr++] = i i = par[i] } for (j in 0 until ptr) { par[visits[j]] = i } return i } private inline fun merge(node: Int, rt: Int): Int { par[node] = rt rank[rt] += rank[node] return rt } private inline fun unite(x: Int, y: Int): Boolean { if (par[x] == par[y]) return false val x1 = find(x) val y1 = find(y) return if (x1 == y1) false else { if (rank[x1] < rank[y1]) merge(x1, y1) else merge(y1, x1) true } } private inline fun isSame(x: Int, y: Int) = find(x) == find(y) fun merge(A1: BitSet, A2: BitSet, dst: BitSet) { init() for (i in 0 until N) { for (j in 0 until N) { if (A1[i*N+j]) unite(i, j+N) if (A2[i*N+j]) unite(i+N, j+N*2) } } for (i in 0 until N) { for (j in i until N) { if (isSame(i, j+2*N)) { dst[i*N+j] = true dst[j*N+i] = true } else { dst[i*N+j] = false dst[j*N+i] = false } } } } fun solve() { val grid = Array(N){ns()} val A0 = BitSet(N*N) for (i in 0 until N) { for (j in 0 until N) { A0[i*N+j] = grid[i][j] == '1' } } // debug{"A0"} // debugDim(A0) val As = mutableListOf() As.add(A0) for (i in 0 until 59) { val A = BitSet(N*N) merge(As.last(), As.last(), A) As += A } // debug{"A[last]"} // debugDim(As.last()) var B: BitSet? = null for (i in 0 until 60) { if ((D shr i and 1) == 1L) { if (B == null) { B = As[i] } else { merge(B, As[i], B) } } } // debug{"B"} // debugDim(B!!) var test = true for (i in 0 until N) { for (j in 0 until N) { test = test && B!![i*N+j] } } val msg = if (test) "Yes" else "No" out.println(msg) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }