ll@h,@w,@y--,@x--,@a[h*w],b=0;
DijkstraHeap<ll>q;
q.malloc(h*w,1);
q.change(y*w+x,0);

while(q.size&&b<=1000000000){
	ll t=q.pop();
	if(b&&a[t]>=b){
		wt("No");
		exit(0);
	}
	b+=a[t];
	if(t/w    ) q.change(t-w,a[t-w]);
	if(t/w<h-1) q.change(t+w,a[t+w]);
	if(t%w    ) q.change(t-1,a[t-1]);
	if(t%w<w-1) q.change(t+1,a[t+1]);
}
wt("Yes");