import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,m = map(int,input().split())
x = list(map(int,input().split()))
c = []
t = []
for i in range(n):
    l = list(map(int,input().split()))
    c.append(l[:-1])
    t.append(l[-1])

jj = set()
kaburi = set()
for i in range(n):
    l = []
    for j in range(m):
        l.append(c[i][j]*t[i])
    l = tuple(l)
    if l in jj:
        kaburi.add(i)
    jj.add(l)


ans = 0
for i in range(n):
    l = []
    for j in range(m):
        l.append(c[i][j]*t[i])
    l = tuple(l)
    if t[i] == 100:
        ans |= l == tuple(x)
        continue
    e = []
    ok = 1
    for j in range(m):
        a = 10000*x[j] - 100*t[i]*c[i][j]
        b = 100-t[i]
        ok &= a % b == 0
        e.append(a//b)
    if i not in kaburi:
        ok &= tuple(e) != l
    if ok:
        ans |= (tuple(e) in jj)

print('Yes') if ans else print('No')