//#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<stdio.h>
using namespace std;
long long n,m;
char mapa[21][21];
int dx[8]={-1,0,1,0,1,-1,1,-1};
int dy[8]={0,1,0,-1,1,1,-1,-1};
int ax[4]={1,-1,0,0};
int ay[4]={0,0,1,-1};
struct xy
{
	int x;
	int y;
};
queue<xy> q;
int bfs(int x,int y)
{
	xy nowa,nexta;
	int sum;
	nowa.x=x;
	nowa.y=y;
	xy a;
	for(int i=0;i<4;i++)
	{
		a.x=nowa.x+ax[i];
		a.y=nowa.y+ay[i];
		if((mapa[a.x][a.y]!='X'&&mapa[a.x][a.y]!='~') || (a.x==0||a.x==n+1||a.y==0||a.y==m+1))
		{
			sum++;
		}
	}
	mapa[x][y]='~';
	q.push(nowa);
	
	while(q.empty()==0)
	{
		nowa=q.front();
		q.pop();
		for(int i=0;i<8;i++)
		{
			nexta.x=nowa.x+dx[i];
			nexta.y=nowa.y+dy[i];
			if(mapa[nexta.x][nexta.y]=='X'&&nexta.x>=1&&nexta.x<=n&&nexta.y>=1&&nexta.y<=m)
			{
				xy a;
				for(int i=0;i<4;i++)
				{
					a.x=nexta.x+ax[i];
					a.y=nexta.y+ay[i];
					if((mapa[a.x][a.y]!='X'&&mapa[a.x][a.y]!='~') || (a.x==0||a.x==n+1||a.y==0||a.y==m+1))
					{
						sum++;
					}
				}
				q.push(nexta);
				mapa[nexta.x][nexta.y]='~';
			}
		}
		
	}
	return sum;
}
int x,y; 
int main()
{
	cin>>n>>m>>x>>y;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
	 		cin>>mapa[i][j];
		}
	}
	cout<<bfs(x,y);
	return 0;
}