//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define all(c) begin(c),end(c)
using namespace std;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge{ll to, cost;};

template <typename T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long MXV = 2000;
vl G[MXV];
vector<vvl> d(MXV,vvl(MXV, vl(2,INF)));

//bfsにかえる(dijkstraでいいじゃん)

//なんで？笑

void dijkstra(int i,int s){
    queue<pair<P,int>> pq;
    d[i][s][0] = 0;
    pair<P,int> q;
    q.first=P(0,s);q.second=0;
    pq.push(q);
    while(pq.size()){
        pair<P,int> p = pq.front();
        pq.pop();
        int V = p.first.second;
        int sig=p.second;
        if(d[i][V][sig] < p.first.first){
            continue;
        }
        rep(k,G[V].size()){
            int to = G[V][k];
            if(d[i][to][1^sig] > d[i][V][sig] + 1){
                d[i][to][1^sig] = d[i][V][sig] + 1;
                pair<P,int> neko;
                neko.first=P(d[i][to][1^sig],to);
                neko.second=1^sig;
                pq.push(neko);
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll V,D;
    cin >> V >> D;
    vector<string> A(V);
    bool ok=true;
    rep(i,V){
        cin >> A[i];
        rep(j,V) if(A[i][j]=='0') ok=false;
    }
    rep(i,V){
        rep(j,V){
            if(A[i][j]=='1'){
                G[i].push_back(j);
            }
        }
    }
    if(ok){
        cout << "Yes" << endl;
        return 0;
    }
    if(D==1){
        cout << "No" << endl;
    }
    ll parity=D%2;
    rep(i,V){
        dijkstra(i,i);
        rep(j,V){
            if(d[i][j][parity]>D){
                cout << "No" << endl;
                return 0;
            }
        }
    }
    cout << "Yes" << endl;
}