#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };



int main(){
	int n, m;
	cin >> n >> m;

	vector<vector<int>>a(1010,vector<int>(1010,0));

	rep(i, 0, m)rep(j, 0, n) {
		cin >> a[i][j];
	}

	rep(i, 0, m)rep(j, 0, n) {
		if (i == 0) {
			continue;
		}
		else {
			a[i][j] += a[i - 1][j];
		}
	}

	rep(i, 0, m) {
		int ok = 0;
		int right = 0;
		int sum = 0;
		rep(left, 0, n) {
			while (right < n && sum + a[i][right] < 777) {
				sum += a[i][right];
				++right;
			}
			if (sum + a[i][right] == 777) {
				cout << "YES" << endl;
				return 0;
			}
			if (right == left)++right;
			else sum -= a[i][left];
		}
	}
	cout << "NO" << endl;


	return 0;
}