#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>

using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005

ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
typedef pair<double,double>d_d;
#define inf 100000000//10^8

/////////////////////////////////




int main(){
    int n,m;cin>>n>>m;
    int sum[n+1];for(int i=0;i<=n;i++)sum[i]=0;
    bool flag=false;
    while(m--){
        int su=0,p;
        for(int i=1;i<=n;i++){
            cin>>p;su+=p;
            sum[i]+=su;
        }
        for(int i=0;i<=n;i++){
            int search=777+sum[i];
            int *p=lower_bound(sum+i,sum+n+1,search);
            if(*p==search)flag=true/*,cout<<m<<" "<<i<<endl*/;
        }
    }
    if(flag)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}