#define _USE_MATH_DEFINES #include #include #include #include #include //#include #include #include #include #include #include #include ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define P(p) cout<<(p)< ///////// typedef long long LL; typedef long double LD; ///////// using namespace::std; ///////// const int V = 160000,INF = 1<<28; int dist[200][200]; bool use[200][200]; int e[400][400]; int dist2[200][200]; bool use2[200][200]; int main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;// //cout << setprecision(10);// int N,V,Ox,Oy; cin>>N>>V>>Ox>>Oy; --Ox; --Oy; int L[200][200]; rep(i,N)rep(j,N){ cin>>L[i][j];//y,x } int dx[4] = { 1, 0,-1, 0}; int dy[4] = { 0, 1, 0,-1}; int px,py,nx,ny; rep(i,N)rep(j,N){ for(int k=0;k<4;++k){ ny = i + dy[k]; nx = j + dx[k]; if(0 <= ny && ny < N && 0 <= nx && nx < N){ e[ny*N+nx][i*N+j] = L[i][j]; } } } rep(i,200)rep(j,200){ dist[i][j] = INF; dist2[i][j] = INF; } priority_queue,greater > q; PII temp; q.push( PII(0,0) ); while( !q.empty() ){ temp = q.top();q.pop(); py = (temp.second/N); px = (temp.second%N); if( use[py][px] == true) continue; use[py][px] = true; dist[py][px] = temp.first; rep(i,4){ ny = py + dy[i]; nx = px + dx[i]; if(0 <= ny && ny < N && 0 <= nx && nx < N && use[ny][nx] == false){ q.push( PII(temp.first + e[py*N+px][ny*N+nx], ny*N+nx) ); } } } if(Ox != -1 || Oy != -1) { rep(i,N)rep(j,N)use[i][j] = false; q.push( PII(0,Oy*N+Ox) ); while( !q.empty() ){ temp = q.top();q.pop(); py = (temp.second/N); px = (temp.second%N); if( use[py][px] == true) continue; use2[py][px] = true; dist2[py][px] = temp.first; rep(i,4){ ny = py + dy[i]; nx = px + dx[i]; if(0 <= ny && ny < N && 0 <= nx && nx < N && use2[ny][nx] == false){ q.push( PII(temp.first + e[py*N+px][ny*N+nx], ny*N+nx) ); } } } } if(dist[N-1][N-1] < V){ P("YES"); } else if( dist[Oy][Ox] < V && dist2[N-1][N-1] < (V-dist[Oy][Ox])*2 ){ P("YES"); } else{ P("NO"); } return 0; }