#include #include using namespace std; using namespace atcoder; //const long nPrime = 1000000007; //const long nPrime = 998244353; typedef long long ll; int main() { ll h,w,x,y; cin >> h >> w >> x >> y; x--,y--; vector> vviNum(h,vector(w,0)); for(ll i = 0; i < h; i++){ for(ll j = 0; j < w; j++){ cin >> vviNum[i][j]; } } multimap siTmp; vector> vviCheck(h,vector(w,0)); ll nTmp = vviNum[x][y]; vviCheck[x][y] = 1; if(x > 0){ siTmp.insert(make_pair(vviNum[x-1][y], (x-1)*w+y)); vviCheck[x-1][y] = 1; } if(y > 0){ siTmp.insert(make_pair(vviNum[x][y-1], x*w+y-1)); vviCheck[x][y-1] = 1; } if(x < h-1){ siTmp.insert(make_pair(vviNum[x+1][y], (x+1)*w+y)); vviCheck[x+1][y] = 1; } if(y < w-1){ siTmp.insert(make_pair(vviNum[x][y+1], x*w+y+1)); vviCheck[x][y+1] = 1; } while(!siTmp.empty()){ auto itr = siTmp.begin(); if(itr->first >= nTmp){ break; } nTmp += itr->first; ll i = itr->second / w; ll j = itr->second % w; siTmp.erase(itr); if(i > 0 && vviCheck[i-1][j] == 0){ siTmp.insert(make_pair(vviNum[i-1][j], (i-1)*w+j)); vviCheck[i-1][j] = 1; } if(j > 0 && vviCheck[i][j-1] == 0){ siTmp.insert(make_pair(vviNum[i][j-1], i*w+j-1)); vviCheck[i][j-1] = 1; } if(i < h-1 && vviCheck[i+1][j] == 0){ siTmp.insert(make_pair(vviNum[i+1][j], (i+1)*w+j)); vviCheck[i+1][j] = 1; } if(j < w-1 && vviCheck[i][j+1] == 0){ siTmp.insert(make_pair(vviNum[i][j+1], i*w+j+1)); vviCheck[i][j+1] = 1; } } if(siTmp.empty()){ cout << "Yes" <