#include using namespace std; #define rep(i,n) for(ll i=0;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,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={0,1,-1,0,1,1,-1,-1,0}; const ll dx[9]={1,0,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } const int SIZE=2048; using matrix=vector>; matrix matmul(matrix &left,matrix &right){ int n=left.size(); matrix ret(n); rep(i,n){ rep(j,n){ if(left[i].test(j))ret[i]|=right[j]; } } return ret; } matrix matpow(matrix &mat,ll k){ int n=mat.size(); matrix ret(n); rep(i,n){//単位行列を作る ret[i].reset(); ret[i].set(i); } while(k){ if(k&1)ret=matmul(mat,ret); mat=matmul(mat,mat); k>>=1; } return ret; } int main(){ ll n,d;cin >> n >> d; matrix mat(n); rep(i,n){ rep(j,n){ char x;cin >> x; if(x=='1')mat[i].set(j); } } auto ans=matpow(mat,d); bool ok=true; rep(i,n)rep(j,n)if(!ans[i][j])ok=false; cout << (ok? "Yes":"No") << endl; }