#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;

int a[1010][1010];
int now[1010];
int main()
{
	int N, M;
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		for (int j = 0; j < N; j++) {
			cin >> a[i][j];
		}
	}
	int sum = 0;
	int k = 0;
	for (int i = 0; i < M; i++) {
		k = 0; sum = 0;
		for (int j = 0; j < N; j++) {
			now[j] += a[i][j];
			sum += now[j];
			while (sum > 777) {
				sum -= now[k];
				k++;
			}
			if (sum == 777) {
				cout << "YES" << endl;
				return 0;
			}
		}
	}
	cout << "NO" << endl;
}