#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
    int n, m;
    cin >> n >> m;
    vl a(n), s(n);
    bool f = false;
    rep(i, m) {
        rep(j, n) cin >> a[j];
        rep(j, n) s[j] += a[j];
        ll sum = s[0];
        if(sum == 777) f = true;
        int l = 0;
        REP(r, 1, n) {
            sum += s[r];
            while(sum > 777) {
                sum -= s[l];
                l++;
                if(l > r) break;
            }
            if(sum == 777) f = true;
        }
    }
    string yes = "YES", no = "NO";
    cout << (f?yes:no) << endl;
    return 0;
}