#include using namespace std; #define int long long using ll=long long; using vi=vector; using pii=pair; #define ALL(c) begin(c),end(c) #define RALL(c) rbegin(c),rend(c) #define ITR(i,b,e) for(auto i=(b);i!=(e);++i) #define FORE(x,c) for(auto &x:c) #define REPF(i,a,n) for(int i=a,i##len=(int)(n);i=0;--i) #define SZ(c) ((int)c.size()) #define CONTAIN(c,x) (c.find(x)!=end(c)) #define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w) #define dump(...) const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0}; #define INF (1001001001) #define INFLL (1001001001001001001ll) template ostream& operator << (ostream &os,const vector &v) { ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":" "); return os; } template istream& operator >> (istream &is,vector &v) { ITR(i,begin(v),end(v)) is>>*i; return is; } template istream& operator >> (istream &is, pair &p) { is>>p.first>>p.second; return is; } template bool chmax(T &a,const T &b) {if(a bool chmin(T &a,const T &b) {if(b using heap = priority_queue,greater>; struct before_main_function { before_main_function() { #ifdef int #undef INF #define INF INFLL #define stoi stoll #endif cin.tie(0);ios::sync_with_stdio(false); cout<>n>>m; vector> a(m,vector(n)); cin>>a; vector b(n,0); REP(i,m) { REP(j,n) b[j]+=a[i][j]; int sum=b[0]; int l=0,r=1; REP(j,n) { while(sum>777) { sum-=b[l]; l++; } if(sum==777) { cout<<"YES"<