#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int N = 2000;
  int v; ll d; cin >> v >> d;
  auto mul = [&](const vector<bitset<N>> &a, const vector<bitset<N>> &b) {
    vector<bitset<N>> bt(v, 0);
    REP(i, v) REP(j, v) {
      if (b[i][j]) bt[j].set(i);
    }
    vector<bitset<N>> c(v, 0);
    REP(i, v) REP(j, v) c[i][j] = !(a[i] & bt[j]).none();
    return c;
  };
  vector<bitset<N>> m(v, 0);
  REP(i, v) REP(j, v) {
    char e; cin >> e;
    if (e == '1') m[i].set(j);
  }
  vector<bitset<N>> ans(v, 0);
  REP(i, v) ans[i].set(i);
  while (d > 0) {
    if (d & 1) ans = mul(ans, m);
    m = mul(m, m);
    d >>= 1;
  }
  REP(i, v) REP(j, v) {
    if (!ans[i][j]) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}