import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    public void solve() {
    	int N = Integer.parseInt(sc.next());
    	int M = Integer.parseInt(sc.next());
    	int[] A = new int[N];
    	int wk, l, r;
    	for (int i = 0; i < M; i++) {
    		for (int j = 0; j < N; j++) {
    			A[j] += Integer.parseInt(sc.next());
    		}
    		wk = l = r = 0;
    		while(l <= N - 1) {
	    		while(r <= N - 1) {
	    			wk += A[r];
//	    			out.println("足した後　　 wk = " + wk + "  A[" + r + "] = " + A[r]);
	    			if(wk == 777) {
	    				out.println("YES");
	    				return;
	    			} else if(wk > 777)	break;
	    			r++;
	    		}
	    		wk -= A[l];
//    			out.println("引いた後　　 wk = " + wk + "  A[" + l + "] = " + A[l]);
    			if(wk == 777) {
    				out.println("YES");
    				return;
    			}
	    		l++;
	    		if(r <= N - 1)	r++;
//    			out.println("　更新後　　l = " + l + "  r = " + r);
    		}
		}
		out.println("NO");
    }
}