#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { int n, m; cin >> n >> m; int a[n] = {}; int flag = 0; rep(i,m){ rep(j,n){ int x; cin >> x; a[j] += x; } int l = 0; int sum = 0; rep(j,n){ sum += a[j]; while(true){ if(sum == 777){ flag = 1; break; }else if(sum < 777){ break; }else{ sum -= a[l]; l++; } } } } if(flag) yn; return 0; }