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

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    vector<string> s(m);
    for(int i = 0;i<m;i++) cin>>s[i];
    vector<vector<int> > cnt(1<<8,vector<int>(1<<8,0));
    vector<vector<long long> >mask(m,vector<long long>(4,0));
    for(ll i = 0;i<m;i++){
        for(ll j = 0;j<n;j++){
            if(j<64) if(s[i][j]=='1') mask[i][0] |= 1LL<<j;
            else if(j<64*2) if(s[i][j]=='1') mask[i][1] |= 1LL<<(j-64);
            else if(j<64*3) if(s[i][j]=='1') mask[i][2] |= 1LL<<(j-64*2);
            else if(s[i][j]=='1') mask[i][3] |= 1LL<<(j-64*3);
        }
    }
    ll mm = 0;
    for(ll i = 0;i<64;i++) mm |= 1LL << i; 
    for(int i = 0;i<n;i++){
        vector<long long> now(4,mm);
        vector<long long> nn(4,mm);
        int c1 = 1,c2 = 1;
        for(int j = 0;j<m;j++){ 
            if(s[j][i]=='1') {

                for(int k = 0;k<4;k++) now[k] &= mask[j][k];
            }
            else{
                for(int k = 0;k<4;k++) nn[k] &= ~mask[j][k];
            }
        }
        if(c1==0) for(int k = 0;k<4;k++) now[k] = 0;
        if(c2==0) for(int k = 0;k<4;k++) nn[k] = 0;
        for(ll j = 0;j<n;j++) if(j!=i) {
            if(j<64) if((nn[0]>>j&1)&&(now[0]>>j)&1) cnt[i][j]++;
            else if(j<64*2) if(((nn[1]>>(j-64))&1)&&(now[1]>>(j-64))&1) cnt[i][j]++;
            else if(j<64*3) if(((nn[2]>>(j-64*2))&1)&&(now[2]>>(j-64*2))&1) cnt[i][j]++;
            else if(((nn[3]>>(j-64*3))&1)&&(now[3]>>(j-64*3))&1) cnt[i][j]++;
        }
    }
    bool fn = true;
    for(int i = 0;i<n;i++) for(int j = 0;j<n;j++) if(cnt[i][j]&&cnt[j][i]) fn = false;
    cout<<(fn?"Yes\n":"No\n");

}