import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.util.BitSet; import java.util.NoSuchElementException; public class Main { public static void main(final String[] args) { new Main(); } public Main() { final InputChecker ic = new InputChecker(System.in); final java.io.PrintWriter out = new java.io.PrintWriter(System.out); solve(ic, out); out.flush(); } public void solve(final InputChecker ic, final java.io.PrintWriter out) { final int V = ic.nextInt(1, 2000); ic.nextChar(' '); final long D = ic.nextLong(1, exponent10L(1, 18)); ic.readNewLine(); final char[][] E = new char[V][]; final CharSet charSet = new CharSet(); charSet.add('0', '1'); for (int i = 0;i < V;++ i) { E[i] = ic.next(charSet).toCharArray(); if (E[i].length != V) throw new AssertionError(); ic.readNewLine(); } ic.checkEOF(); for (int i = 0;i < V;++ i) { for (int j = 0;j < V;++ j) { if (E[i][j] != E[j][i]) throw new AssertionError(); } } final BitSet[] graph = new BitSet[V]; for (int i = 0;i < V;++ i) { graph[i] = new BitSet(V); for (int j = 0;j < V;++ j) graph[i].set(j, E[i][j] == '1'); } boolean ans = graph[0].cardinality() > 0; for (int i = 0;i < V;++ i) { BitSet now = (BitSet)graph[i].clone(), one = new BitSet(V), two = new BitSet(V), three = new BitSet(V); one.set(i); for (int j = 1;j < D;++ j) { final BitSet check = (BitSet)now.clone(); check.xor(two); if (check.isEmpty()) break; two = (BitSet)one.clone(); for (int k = check.nextSetBit(0);k >= 0;k = check.nextSetBit(k + 1)) one.or(graph[k]); three = now; now = one; one = three; } ans &= now.cardinality() == V; } out.println(ans ? "Yes" : "No"); } public static int exponent10(final int n, final int e) { return n * pow(10, e); } public static long exponent10L(final int n, final int e) { return n * pow(10L, e); } public static int pow(final int a, int b) { int ans = 1; for (int mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul; return ans; } public static long pow(final long a, long b) { long ans = 1; for (long mul = a;b > 0;b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul; return ans; } public static class CharSet { private final BitSet set = new BitSet(256); public void add(final char... c) { for (final char i : c) set.set(i); } public void add(final CharSet... s) { for (final CharSet i : s) set.or(i.set); } public boolean contains(final char... c) { for (final char i : c) if (!set.get(i)) return false; return true; } public boolean contains(final String s) { return contains(s.toCharArray()); } private static final class Chars extends CharSet { public Chars(final char... c) { super.add(c); } public Chars(final CharSet... s) { super.add(s); } @Override public void add(final char... c) { throw new UnsupportedOperationException(); } @Override public void add(final CharSet... s) { throw new UnsupportedOperationException(); } } public static final CharSet NUMBER = new Chars('0','1','2','3','4','5','6','7','8','9'); public static final CharSet LOWER = new Chars('a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'); public static final CharSet UPPER = new Chars('A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'); public static final CharSet ALPHABET = new Chars(LOWER, UPPER); } public static class InputChecker { private InputStream in; private final byte[] buffer = new byte[1024]; private final byte[] undo = new byte[1024]; private int undoSize = 0; private int read = 0; private int length = 0; public InputChecker(final InputStream in) { this.in = in; } public final void setInputStream(final InputStream in) { this.in = in; } public final void setInputStream(final File in) { try { this.in = new FileInputStream(in); } catch (final FileNotFoundException e) { e.printStackTrace(); } } private boolean hasNextByte() { if (undoSize > 0) return true; if (read < length) return true; read = 0; try { length = in.read(buffer); } catch (final IOException e) { e.printStackTrace(); } return length > 0; } private byte readByte() { if (hasNextByte()) return undoSize > 0 ? undo[--undoSize] : buffer[read++]; throw new NoSuchElementException(); } private void undo(final byte b) { undo[undoSize ++] = b; } private void undo(final char c) { if ((c & 0xFF80) == 0) { undo((byte)c); return; } undo((byte)(c & 0x3F | 0x80)); if ((c & 0xF800) == 0) { undo((byte)(c >> 6 & 0x1F | 0xC0)); } else { undo((byte)(c >> 6 & 0x3F | 0x80)); undo((byte)(c >> 12 | 0xE0)); } } public final boolean hasNext() { return hasNextByte(); } public final char nextChar() { final byte b = readByte(); if ((b & 0x80) == 0) return (char)b; if ((b & 0x20) == 0) return (char)((b & 0x1F) << 6 | readByte() & 0x3F); return (char)((b & 0xF) << 12 | (readByte() & 0x3F) << 6 | readByte() & 0x3F); } public final char nextChar(final char estimate) { final char c = nextChar(); if (estimate == c) return estimate; undo(c); throw new AssertionError(); } public final char nextChar(final CharSet estimate) { final char c = nextChar(); if (estimate.contains(c)) return c; undo(c); throw new AssertionError(); } public final void readNewLine() { char c = nextChar(); if (c == '\r') { c = nextChar(); if (c != '\n') undo(c); return; } else if (c == '\n') return; undo(c); throw new AssertionError(); } public final void checkEOF() { if (hasNextByte()) throw new AssertionError(); } public final String next(final CharSet contains) { final StringBuilder sb = new StringBuilder(); try { do { final char c = nextChar(); if (!contains.contains(c)) { undo(c); return sb.toString(); } sb.append(c); } while(true); } catch (final NoSuchElementException e) { if (sb.length() <= 0) throw new AssertionError(); return sb.toString(); } } public final int nextInt() { byte b = readByte(); int n = 0; if (b == '-') { if (!isNumber(b = readByte())) { undo(b); throw new NumberFormatException(); } try { if (b == '0') { if (!isNumber(b = readByte())) { undo(b); return 0; } throw new NumberFormatException(); } do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte())); undo(b); } catch (final NoSuchElementException e) { } return n; } if (!isNumber(b)) { undo(b); throw new NumberFormatException(); } try { if (b == '0') { if (!isNumber(b = readByte())) { undo(b); return 0; } throw new NumberFormatException(); } do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte())); undo(b); } catch (final NoSuchElementException e) { } return n; } public final int nextInt(final int min, final int max) { final int n = nextInt(); if (min <= n && n <= max) return n; throw new NumberFormatException(); } private static boolean isNumber(final byte c) { return '0' <= c && c <= '9'; } public final long nextLong() { byte b = readByte(); long n = 0; if (b == '-') { if (!isNumber(b = readByte())) { undo(b); throw new NumberFormatException(); } try { if (b == '0') { if (!isNumber(b = readByte())) { undo(b); return 0; } throw new NumberFormatException(); } do n = Math.addExact(Math.multiplyExact(n, 10), '0' - b); while(isNumber(b = readByte())); undo(b); } catch (final NoSuchElementException e) { } return n; } if (!isNumber(b)) { undo(b); throw new NumberFormatException(); } try { if (b == '0') { if (!isNumber(b = readByte())) { undo(b); return 0; } throw new NumberFormatException(); } do n = Math.addExact(Math.multiplyExact(n, 10), b - '0'); while(isNumber(b = readByte())); undo(b); } catch (final NoSuchElementException e) { } return n; } public final long nextLong(final long min, final long max) { final long n = nextLong(); if (min <= n && n <= max) return n; throw new NumberFormatException(); } public final double nextDouble() { final StringBuilder sb = new StringBuilder(); byte b = readByte(); if (b == '-') { sb.append(b); b = readByte(); } if (b == '0') { sb.append(b); b = readByte(); } else { while(isNumber(b)) { sb.append(b); b = readByte(); } } if (b == '.') { sb.append(b); b = readByte(); while(isNumber(b)) { sb.append(b); b = readByte(); } } if (b == 'e' || b == 'E') { sb.append(b); b = readByte(); if (b == '-' || b == '+') { sb.append(b); b = readByte(); } while(isNumber(b)) { sb.append(b); b = readByte(); } } undo(b); return Double.parseDouble(sb.toString()); } } }