#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e933
#define INFL 1e18
#define MOD 1e9+7
#define pb push_back
#define MP make_pair
typedef long long int ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main() {
    int N,M;
    cin>>N>>M;
    vector<int> train(N,0);
    rep(i,0,M){
        rep(j,0,N){
            int x;cin>>x;
            train[j]+=x;
        }
        
        int left=-1,right=0,sum=0;
        for(int right=0;right<N;right++){
            sum+=train[right];
            while(sum>777&&left<right){
                left++;
                sum-=train[left];
            }
            if(sum==777){
                cout<<"YES"<<endl;
                return 0;
            }
        }
    }
    cout<<"NO"<<endl;
    return 0;
}