ll@n,@m,@x[m],y[],c[n][m],t[n],d[],e[];
rep(i,n){
	rd(c[i](m),t[i]);
	rep(j,m){
		c[i][j]*=t[i];
	}
}
d[0..n-1]=(0..);
rrep(j,m){
	rep(i,n){
		e[i]=c[d[i]][m];
	}
	sortA(n,e,d);
}
x[0..m-1]*=100;
rep(i,n){
	rep(j,m){
		ll u=x[j]-c[i][j];
		if(u*100%(100-t[i])){
			goto hoge;
		}
		y[j]=u*100/(100-t[i]);
	}
	if(1){
		ll a=bsearch_min[ll,k,0,n](lexicographical_compare(y,y+m,c[k],c[k]+m));
		ll b=bsearch_min[ll,k,0,n](!lexicographical_compare(c[k],c[k]+m,y,y+m));
		if(a!=b){
			wt("Yes");
			exit(0);
		}
	}
	hoge:;
}
wt("No");