#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, X = 60;
  int v; ll d; cin >> v >> d;
  vector dp(X, vector(v, bitset<N>(0)));
  REP(i, v) REP(j, v) {
    char e; cin >> e;
    if (e == '1') dp[0][i].set(j);
  }
  FOR(i, 1, X) REP(j, v) REP(k, v) {
    if (dp[i - 1][j][k]) dp[i][j] |= dp[i - 1][k];
  }
  REP(s, v) {
    bitset<N> reach(0);
    reach.set(s);
    REP(b, X) {
      if (d >> b & 1) {
        bitset<N> nx(0);
        REP(i, v) {
          if (reach[i]) nx |= dp[b][i];
        }
        reach = nx;
      }
    }
    if (reach.count() < v) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}