#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 1234
#endif

int N,M;
int A[SIZE];

bool check() {
    int l=0,r=0,s=A[0];
    while(l<N && r<N) {
        while (s < 777 && r<=N-1) {
            s += A[++r];
        }
        if (s == 777) return true;
        while (s > 777 && l<=N) {
            s -= A[l++];
        }
    }
    return false;
}

void solve() {
    cin>>N>>M;
    while(M--) {
        int a;
        REP(i,N) {
            cin>>a;
            A[i]+=a;
        }
        if (check()) {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}