import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
3 3
100 120 140
80 100 160 75
320 360 160 50
0 5 10 30
2 4
0 0 0 0
0 10 20 30 40
50 60 70 80 90
"""

def solve(test):
  N,M=map(int,input().split())
  X=list(map(int,input().split()))
  C=[list(map(int,input().split())) for _ in range(N)]
  s=set([tuple([C[i][-1]*C[i][j] for j in range(M)]) for i in range(N)])
  ans='No'
  for i in range(N):
    tmp=[]
    for j in range(M):
      if (10000*X[j]-100*C[i][-1]*C[i][j])%(100-C[i][-1])==0:
        tmp.append((10000*X[j]-100*C[i][-1]*C[i][j])//(100-C[i][-1]))
    if tuple(tmp) in s:
      ans='Yes'
      break
  print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)