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

int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> a(m, vector<int>(n));
	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];
		}
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			int num = max(
							upper_bound(a[i].begin(), a[i].end(), a[i][j] - 777) - lower_bound(a[i].begin(), a[i].end(), a[i][j] - 777),
							upper_bound(a[i].begin(), a[i].end(), 777) - lower_bound(a[i].begin(), a[i].end(), 777)
							);
			if (0 < num) {
				cout << "YES" << endl;
				return 0;
			}
		}
	}
	cout << "NO" << endl;
	return 0;
}