#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

vvl matmul(vvl &dp, vvl &mt){
    ll m=mt.size();
    vvl ret(m,vl(m,0));
    rep(i,m)rep(j,m)rep(k,m){
        ret[i][j]|=dp[i][k]&mt[k][j];
    }
    return ret;
}

void matpow(vvl &dp, vvl &mt, ll k){
    ll m=dp.size();
    while(k){
        if(k&1)dp=matmul(dp,mt);
        mt=matmul(mt,mt);
        k/=2;
    }
}

int main(){
  ll n,k;cin >> n >>k;
  vvl dp(n,vl(n)),mat(n,vl(n));
  rep(i,n)dp[i][i]=1;
  rep(i,n)rep(j,n){
    char x;cin >> x;
    mat[i][j]=x-'0';
  }
  matpow(dp,mat,min(k,2*n));
  bool ok=true;
  rep(i,n)rep(j,n)if(!dp[i][j])ok=false;
  cout << (ok? "Yes":"No") <<endl;
  /*rep(i,n){
      rep(j,n){
          cout << dp[i][j];
      }
      cout << endl;
  }*/
}