#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = (ll)(1e+9) + 7; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; typedef pair LDP; int d[200][200]; int c[200][200]; struct vertice { int d, x, y; bool operator<(const vertice &v)const { if (v.d != d)return v.d < d; if (v.x != x)return v.x > x; return v.y > y; } }; int dx[4] = { 1,0,-1,0 }; int dy[4] = { 0,1,0,-1 }; int main(){ int n, v, x, y; cin >> n >> v >> x >> y; x--; y--; rep(i, n) { rep(j, n) { cin >> c[i][j]; d[i][j] = (int)mod; } } priority_queue q; q.push({ 0,0,0 }); d[0][0] = 0; while (!q.empty()) { vertice v = q.top(); q.pop(); rep(j, 4) { int nx = v.x + dx[j]; int ny = v.y + dy[j]; if (nx < 0 || ny < 0 || nx >= n || ny >= n)continue; int nd = v.d + c[nx][ny]; if (nd < d[nx][ny]) { d[nx][ny] = nd; q.push({ nd,nx,ny }); } } } string ans = "NO"; if (d[n - 1][n - 1] < v)ans = "YES"; if (x >= 0) { rep(i, n) { rep(j, n) { d[i][j] = (int)mod; } } q.push({ 0,x,y }); d[x][y] = 0; while (!q.empty()) { vertice v = q.top(); q.pop(); rep(j, 4) { int nx = v.x + dx[j]; int ny = v.y + dy[j]; if (nx < 0 || ny < 0 || nx >= n || ny >= n)continue; int nd = v.d + c[nx][ny]; if (nd < d[nx][ny]) { d[nx][ny] = nd; q.push({ nd,nx,ny }); } } } int rest = v-d[0][0]+c[0][0]-c[x][y]; if (rest > 0) { rest *= 2; if (rest > d[n - 1][n - 1])ans = "YES"; } } cout << ans << endl; return 0; }