def extgcd(a, b):
    if b:
        d, y, x = extgcd(b, a % b)
        y -= (a // b) * x
        return d, x, y
    return a, 1, 0

#以下modinv
def mod_inv(a, m):
    g, x, y = extgcd(a, m)

    if g != 1:
        raise Exception()

    if x < 0:
        x += m

    return x

import sys
input=sys.stdin.readline
N,M=map(int,input().split())
X=list(map(int,input().split()))
C=[]
T=[]
Cset=set()
p=998244353
inv100=mod_inv(100,p)
for i in range(N):
    c=list(map(int,input().split()))
    C.append(c[:-1])
    T.append(c[-1])
    Ct=c[:-1]
    for i in range(M):
        Ct[i]*=T[-1]*inv100
        Ct[i]%=p
    Cset.add(tuple(Ct))
for i in range(N):
    if T[i]==100:
        if C[i]==X:
            print('Yes')
            exit(0)
        continue
    tinv=mod_inv((1-T[i]*inv100)%p,p)
    for j in range(M):
        C[i][j]*=T[i]*inv100%p
        C[i][j]%=p
        C[i][j]=X[j]-C[i][j]
        C[i][j]%=p
        C[i][j]*=tinv
        C[i][j]%=p
    if tuple(C[i]) in Cset:
        print('Yes')
        exit(0)
print('No')