#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;




int main() {

	int n, m;
	cin >> n >> m;
	VI v(n);
	REP(z, m) {
		REP(i, n) {
			int a;
			cin >> a;
			v[i] += a;
		}
		VI b(n+1, 0);
		b[0] = 0;
		REP(i, n) {
			b[i + 1] = b[i] + v[i];
		}
		int left = 0, right = 0;
		
		for (right = 0; right <= n; right++) {
			if (b[right] - b[left] == 777) {
				cout << "YES" << endl;
				return 0;
			}
			
			while (b[right] - b[left] > 777) {
				left++;
				if (b[right] - b[left] == 777) {
					cout << "YES" << endl;
					return 0;
				}

			}

		}



	}

	cout << "NO" << endl;

	return 0;


}