#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)


int main(){
    int n, m;
    cin >> n >> m;
    int a[m][n];
    for (int i = 0; i < m; i++){
        for (int j = 0; j < n; j++) cin >> a[i][j];
    }

    int t[n], Sum[n + 1];
    memset(t, 0, sizeof(t));
    memset(Sum, 0, sizeof(Sum));

    for (int i = 0; i < m; i++){
        for (int j = 0; j < n; j++){
            t[j] += a[i][j];
            Sum[j + 1] = Sum[j] + t[j];
        }

        for (int j = 0; j <= n; j++){
            if (Sum[j] < 777) continue;
            int k = Sum[j] - 777;
            if (*lower_bound(Sum, Sum + j, k) == k){
                cout << "YES" << endl;
                return 0;
            }
        }
    }

    cout << "NO" << endl;

    return 0;
}