#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll N, M;
vector<ll> A;

// しゃくとり法
bool is_777(){
    ll left = 0;
    ll right = 0;
    ll sum = A[0];

    if(sum==777) return true;

    while(left!=N-1){
        if(sum==777) return true;

        // 足りない
        if(sum<777){
            right++;
            if(right<N){
                sum+=A[right];
            }else{
                return false;
            }
        }
        // 余分
        else{
            sum -= A[left];
            left++;

            if(left>right){
                right = left;
                sum = A[left];
            }
        }
    }

    if(sum==777) return true;

    return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> N >> M;
    A.resize(N);
    
    FOR(i, 0, M){
        FOR(j, 0, N){
            ll a;
            cin >> a;
            A[j] += a;
        }

        if(is_777()){
            p_yes();
            return 0;
        }
    }
    
    p_no();
    
    return 0;
}