#include<bits/stdc++.h>
#define p1 p_1
#define p2 p_2
using namespace std;
int n,m,p1,p2,ans;
int a[1006][1006];
int fx[]={0,1,-1,0,0};
int fy[]={0,0,0,1,-1};
int t;
void Dfs(int x,int y){
	ans++;
	a[x][y]=INT_MAX;
	for(int i=1;i<=4;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&t>=a[tx][ty]){
			
			Dfs(tx,ty);
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m>>p1>>p2;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	t=a[p1][p2];
	Dfs(p1,p2);
	cout<<ans;
	return 0;
}

/**************************************************************
	Problem: 1443
	User: chenxurui
	Language: C++
	Result: Accepted
	Time:17 ms
	Memory:6672 kb
****************************************************************/