#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

#define rd_init() char*rp=({char*mmap();mmap(0l,1l<<25,1,2,0,0ll);})
#define rd() ({int _v=0,_c;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_v;})
#define rep(v,e) for(typeof(e) v=0;v<e;++v)

#define HASH_BITS 18
#define HASH_MASK ((1<<HASH_BITS)-1)
long hash[1<<HASH_BITS];
int hash_add(long x){
	int h=x&HASH_MASK;
	while(1){
		if(hash[h]==0){
			hash[h]=x;
			return h;
		}
		if(hash[h]==x){
			return h;
		}
		h=h+1&HASH_MASK;
	}
}

int hs[200000];
int ws[200000];
int count[1<<HASH_BITS];

int main(){
	rd_init();
	int n=rd();
	int m=rd();
	int k=0;
	int xs[10];
	rep(j,m){
		xs[j]=rd()*10000;
	}
	rep(i,n){
		int cs[10];
		rep(j,m){
			cs[j]=rd();
		}
		int t=rd();
		{
			long r=1;
			rep(j,m){
				r=r*257+cs[j]*t;
			}
			int h=hash_add(r);
			hs[k]=h;
			count[h]+=1;
		}
		if(t==100){
			rep(j,m){
				if(xs[j]!=cs[j]*10000){
					goto next;
				}
			}
			write(1,"Yes",3);
			_exit(0);
		}else{
			long r=1;
			rep(j,m){
				int u=xs[j]-cs[j]*t*100;
				int v=100-t;
				if(u%v) goto next;
				r=r*257+u/v;
			}
			ws[k]=hash_add(r);
		}
		++k;
		next:;
	}
	rep(i,k){
		if(count[ws[i]]>(hs[i]==ws[i])){
			write(1,"Yes",3);
			_exit(0);
		}
	}
	write(1,"No",2);
	_exit(0);
}