// Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll infll = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << (i + 1 == vec_len ? "" : " ");
    }
    return os;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;

// Main
int main() {
    int v;
    ll d;
    cin >> v >> d;
    vector<string> e(v);
    cin >> e;
    
    vector<vector<int>> g(2 * v);
    rep(i, v) rep(j, v) {
        if (e[i][j] == '1') {
            g[i].push_back(j + v);
            g[j].push_back(i + v);
            g[i + v].push_back(j);
            g[j + v].push_back(i);
        }
    }
    
    rep(i, v) {
        vector<ll> dist(2 * v, inf);
        queue<int> que;
        dist[i] = 0;
        que.push(i);
        while (!que.empty()) {
            int v = que.front();
            que.pop();
            for (int u : g[v]) {
                if (chmin(dist[u], dist[v] + 1)) que.push(u);
            }
        }
        rep(j, v) {
            if (d % 2 == 0) {
                if (dist[j] > d) {
                    cout << "No\n";
                    return 0;
                }
            } else {
                if (dist[j + v] > d) {
                    cout << "No\n";
                    return 0;
                }
            }
        }
    }
    cout << "Yes\n";
}