#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<random>
#include<complex>
#include<math.h>
#include<functional>
#include<stack>
#include<queue>
#include<unordered_map>
#include<set>
#include<numeric>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int inf = 0x3fffffff;
const ll INF = 1e18;
int main() {
	int h, w; cin >> w >> h; vector<vector<int>>  a(h+1, vector<int>(w+1));
	rep(i, h) rep(j, w) cin >> a[i][j];
	rep(i, h) rep(j, w) a[i][j + 1] += a[i][j];
	rep(i, h ) rep(j, w) a[i + 1][j] += a[i][j];
	rep(i, h) rep(j, w) {
		int d = a[i][j] - 777;
		if (d < 0)continue;
		if (d == 0) {
			cout << "YES" << endl;
			return 0;
		}int k = lower_bound(a[i].begin(), a[i].begin() + j, d) - a[i].begin();
		if (k != j && a[i][j] - a[i][k] == 777) {
			cout << "YES" << endl;
			return 0;
		}
	}cout << "NO" << endl;
}