#include<bits/stdc++.h>
using namespace std;
int main(){
  int n,v,ox,oy;cin >> n >> v >> ox >> oy;
  ox--,oy--;
  vector<vector<int>> a(n,vector<int>(n));
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      cin >> a[i][j];
    }
  }
  int dp[n][n][2];
  memset(dp,0,sizeof(dp));
  if(v-a[0][0]<=0){
      cout << "NO" << endl;
      return 0;
  }
  dp[0][0][0]=v-a[0][0];
  int dx[4]={1,0,-1,0};
  int dy[4]={0,1,0,-1};
  queue<pair<pair<int,int>,int>> q;
  q.push({{0,0},0});
  while(!q.empty()){
    int u=q.front().first.first,v=q.front().first.second,w=q.front().second;
    q.pop();
    for(int i=0;i<4;i++){
      int x=u+dx[i],y=v+dy[i];
      if(x>=0&&x<=n-1&&y>=0&&y<=n-1){
        if(dp[x][y][w]<dp[u][v][w]-a[x][y]){
          dp[x][y][w]=dp[u][v][w]-a[x][y];
          q.push({{x,y},w});
        }
        if(!w&&x==ox&&y==oy){
          if(dp[x][y][1]<(dp[u][v][0]-a[x][y])*2){
            cout << dp[u][v][0] << " " << a[x][y] << endl;
            dp[x][y][1]=(dp[u][v][0]-a[x][y])*2;
            q.push({{x,y},1});
          }
        }
      }
    }
  }
  if(dp[n-1][n-1][0]||dp[n-1][n-1][1]){
    cout << "YES" << endl;
  }
  else{
    cout << "NO" << endl;
  }
}