#include<bits/stdc++.h>
using namespace std;

int main() {
    int v;
    long long d;
    cin >> v >> d;
    d = min(d, v * 2LL);
    using bs = bitset<2000>;
    vector<bs> E(v);
    for (auto& i : E) {
        string str;
        cin >> str;
        reverse(str.begin(), str.end());
        i = bs(str);
    }
    const int pwrdp = 12; // 2^12 > V + 998 > 2^11
    vector<vector<bs>> dp(pwrdp, vector<bs>(v));
    dp[0] = E;

    auto prodOR = [v](const vector<bs>& A, const vector<bs>& B) {
        vector<bs> X(v);
        for (int i = 0; i < v; ++i) {
            for (int j = A[i]._Find_first(); j < v; j = A[i]._Find_next(j)) {
                X[i] |= B[j];
            }
        }
        return X;
    };

    for (int i = 1; i < pwrdp; ++i) {
        dp[i] = prodOR(dp[i - 1], dp[i - 1]);
    }

    vector<bs> Rchbl(v);
    for (int i = 0; i < v; ++i) Rchbl[i].set(i);
    
    for (int di = 0, dd = d; dd > 0; ++di, dd /= 2) {
        if (dd & 1) Rchbl = prodOR(Rchbl, dp[di]);
    }
    
    for (int i = 0; i < v; ++i)
        if (Rchbl[i].count() < v) return cout << "No" << endl, 0;
    cout << "Yes" << endl;
}