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

const int MAXN = 1 << 10;
const int MAXM = 1 << 10;

int N, M;
int A[MAXM][MAXN];
int cur[MAXN];
int pcur[MAXN + 1];

signed main() {
  ios::sync_with_stdio(false);
  cin >> N >> M;
  for (int i = 0; i < M; ++i) {
    for (int j = 0; j < N; ++j) {
      cin >> A[i][j];
    }
  }
  for (int i = 0; i < M; ++i) {
    for (int j = 0; j < N; ++j) {
      cur[j] += A[i][j];
    }
    for (int j = 0; j < N; ++j) {
      pcur[j + 1] = pcur[j] + cur[j];
    }
    multiset<int> bag;
    for (int j = 0; j <= N; ++j) {
      bag.emplace(pcur[j]);
    }
    for (int j = 0; j < N; ++j) {
      bag.erase(bag.find(pcur[j]));
      if (bag.count(777 + pcur[j])) {
        cout << "YES" << endl;
        exit(0);
      }
    }
  }
  cout << "NO" << endl;
  return 0;
}