#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using m1 = atcoder::modint998244353;
using m2 = atcoder::modint1000000007;
#include<array>
const int B = 4;
using dat = array<ll,B>;
ll mods[] = {998244353,1000000007,1000000009,999999999};
dat add(dat a,dat b){
    dat e{};
    for(int i = 0;i<B;i++) e[i] = (a[i]+b[i]) % mods[i];
    return a;
}
dat minuss(dat a,dat b){
    for(int i = 0;i<B;i++){
        b[i] *= -1;
        if(b[i]<0) b[i] += mods[i];
    }
    return add(a,b);
}
dat Set(ll a){
    dat e{};
    for(int i = 0;i<B;i++) e[i] = a;
    return e;
}

ll mpow(ll a,ll k,ll mod){
    ll e = 1;
    while(k){
        if(k&1) e = (e*a) % mod;
        a = (a*a) % mod;
        k >>= 1;
    }
    return e;
}
dat make_dat(ll c){
    dat e{};
    for(int i = 0;i<B;i++){
        e[i] = mpow(2,c,mods[i]);
        e[i] -= c + 1;
        if(e[i]<0) e[i] += mods[i];
    }
    return e;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<int> cnt(1<<n,0);
    for(int i = 0;i<m;i++){
        string s;
        cin>>s;
        int now = 0;
        for(int j = 0;j<n;j++) if(s[j]=='1') now |= 1 << j;
        cnt[now] = 1;
    }

    int mask = (1<<n) - 1;
    if(cnt[mask]==0){
        cout<<"No\n";
        return 0;
    }
    if(cnt[0]==0){
        cout<<"No\n";
        return 0;
    }

    {
        vector<ll> c(1<<n,0);
        for(int i = 0;i<1<<n;i++) c[i] = cnt[i];
        for(int k = 0;k<1<<n;k++){
            for(int i = 0;i<n;i++) if(k>>i&1){
                int nk = k ^ (1<<i);
                c[nk] += c[k];
            }
        }
        for(int i = 0;i<1<<n;i++) c[i] = ((c[i])*(c[i]-1)) / 2;
        for(int k = 0;k<1<<n;k++){
            for(int i = 0;i<n;i++) if(k>>i&1){
                int nk = k ^ (1<<i);
                c[nk] -= c[k];
            }
        }
        for(int i = 0;i<1<<n;i++) if(c[i]!=0){
            if(cnt[i]==0){
                cout<<"No\n";
                return 0;
            }
        }
    }

    {
        vector<ll> c(1<<n,0);
        for(int i = 0;i<1<<n;i++) c[i] = cnt[i];
        for(int k = 0;k<1<<n;k++){
            for(int i = 0;i<n;i++) if(k>>i&1){
                int nk = k ^ (1<<i);
                c[k] += c[nk];
            }
        }
        vector<dat> now(1<<n);
        for(int i = 0;i<1<<n;i++){
            if(c[i]<2) continue;
            now[i] = make_dat(c[i]);
        }
        for(int k = 0;k<1<<n;k++){
            for(int i = 0;i<n;i++) if(k>>i&1){
                int nk = k ^ (1<<i);
                now[k] = minuss(now[k],now[nk]);
            }
        }
        for(int i = 0;i<1<<n;i++){
            if(now[i]==Set(0)) continue;
            if(cnt[i]==0) {
                cout<<"No\n";
                return 0;
            }
        }
    }
    cout<<"Yes\n";

}