#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> num(m,vector<int>(n,0));
  rep(i,m) rep(j,n) cin >> num[i][j];
  for (int i = 1; i < m; i++) rep(j,n) num[i][j] += num[i-1][j];
  rep(i,m) rep(j,n-1) num[i][j+1] += num[i][j]; 
  bool ok = false;
  rep(i,m) {
    rep(j,n) {
      int v = num[i][j] - 777;
      if (v < 0) continue;
      if (v == 0) ok = true;
      int itr = lower_bound(num[i].begin(), num[i].end(), v) - num[i].begin();
      if (itr != j && num[i][j] - num[i][itr] == 777) ok = true;
    }
  }
  if (ok) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}