#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;

int a[1252][1252];

int main(){
  scanf("%d%d",&n,&m);
  REP(i,m)REP(j,n)scanf("%d",&a[i][j]);
  FOR(i,1,m)REP(j,n)a[i][j] += a[i-1][j];
  REP(i,m){
    FORR(j,0,n)a[i][j+1] = a[i][j];
    a[i][0] = 0;
    REP(j,n+1)a[i][j+1] += a[i][j];
    // REP(j,n+1)printf("%d ",a[i][j]);puts("");
    REP(j,n+1){
      int rig = a[i][j];
      // rig - lft = 777
      int lft = *lower_bound(a[i], a[i]+j, rig-777);
      if(rig-lft == 777){
        puts("YES");
        return 0;
      }
    }
  }
  puts("NO");
  return 0;
}