#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
using bs = vector<bool>;

bs operator^(const bs& lhs, const bs& rhs) {
    bs res(lhs);
    int s = res.size();
    for (int i = 0; i < s; ++i) res[i] = res[i] ^ rhs[i];
    return res;
}

bs& operator|=(bs& lhs, const bs& rhs){
    int s = lhs.size();
    for (int i = 0; i < s; ++i) lhs[i] = lhs[i] | rhs[i];
    return lhs;
}

void bset(bs& v, int k) {v[k] = true;}

bool any(const bs& v) {
    for(const auto& i:v)
        if (i) return true;
    return false;
}

int count(const bs& v){
    int r = 0;
    for (const auto& i : v)
        if (i) ++r;
    return r;
}

signed main() {
    int v, d;
    cin >> v >> d;
    vector<bs> G(v, bs(v,false));

    for (int i = 0; i < v; ++i) {
        string s;
        cin >> s;
        for (int j = 0; j < v; ++j)
            if (s[j] == '1') bset(G[i],j);
    }
    bool valid = true;

    for (int src = 0; valid && src < v; ++src) {
        if (!any(G[src])) {
            valid = false;
            break;
        }
        
        bs pos(v,false), onext(pos), enext(pos);
        bset(pos,src);
        bset(enext,src);
        int mv = 0;
        while (mv < d) {
            for (int i = 0; i < v;++i)
                if (pos[i]) onext |= G[i];
            if (!any(pos ^ onext)) break;
            pos = onext;
            ++mv;
            if (mv >= d) break;
            for (int i = 0; i < v; ++i)
                if (pos[i]) enext |= G[i];
            if (!any(pos ^ enext)) break;
            pos = enext;
            ++mv;
            if (mv >= d) break;
        }
        if((d%2 ? count(onext) : count(enext)) < v) valid = false;
    }
    cout << (valid ? "Yes" : ":(") << endl;
}