#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
const int INF = (int)1e9 + 1;

int n, m, a[1001][1001] = {};

int main(void) {
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		for(int j = 0; j < n; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i < m; i++) {
		for (int j = 0; j < n; j++) {
			a[i][j] += a[i - 1][j];
		}
	}
	for (int i = 0; i < m; i++) {
		for (int j = 1; j < n; j++) {
			a[i][j] += a[i][j - 1];
		}
	}

	string ans = "NO";

	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			int d = a[i][j] - 777;
			if (d < 0) continue;
			if (d == 0) ans = "YES";
			int k = lower_bound(a[i], a[i] + j, d) - a[i];
			if (k != j) if (a[i][j] - a[i][k] == 777) ans = "YES";
		}
	}
	cout << ans << '\n';
	return 0;
}