from bisect import bisect_left

n, m = map(int, input().split())
C = [0 for _ in range(n)]
for _ in range(m):
    A = list(map(int, input().split()))
    for i in range(n):
        C[i] += A[i]
    accumC = [0]
    for i in range(n):
        accumC.append(accumC[-1] + C[i])
    flag = False
    for i in range(n):
        res = accumC[i]
        idx = bisect_left(accumC, res + 777)
        if idx < n + 1 and accumC[idx] == res + 777:
            flag = True
            break
    if flag:
        print("YES")
        exit()
print("NO")