#include <stdio.h>
int sum;
int mx,my;
char a[1005][1005];
int getnum(int x,int y)
{
sum=0;
int i,j;
i=x;j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G') sum++;
i--;
}
i=x;j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G') sum++;
i++;
}
i=x;j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G') sum++;
j--;
}
i=x;j=y;
while(a[i][j]!='#')
{
if(a[i][j]=='G') sum++;
j++;
}
return sum;
}
int max;
int n,m;
int x,y;
int tx,ty;
int book[1005][1005];
int next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void dfs(int x,int y)
{
sum=getnum(x,y);
if(sum>max)
{
max=sum;
mx=x;
my=y;
}
for(int i=0;i<4;i++)
{
tx=x+next[i][0];
ty=y+next[i][1];
if(tx<0||tx>n-1||ty<0||ty>m-1) continue;
if(book[tx][ty]==0&&a[tx][ty]=='.')
{
book[tx][ty]=1;
dfs(tx,ty);
book[tx][ty]=0;
}
}
return ;
}
int main()
{
scanf("%d %d",&n,&m);
scanf("%d %d",&x,&y);
for(int i=0;i<n;i++)
{
scanf("%s",a[i]);
}
max=getnum(x,y);
book[x][y]=1;
dfs(x,y);
printf("最好放在(%d,%d),最多消灭%d个敌人",mx,my,max);
}
/*
13 13 3 3
#############
#GG.GGG#GGG.#
###.#G#G#G#G#
#.......#..G#
#G#.###.#G#G#
#GG.GGG.#.GG#
#G#.#G#.#.#.#
##G...G.....#
#G#.#G###.#G#
#...G#GGG.GG#
#G#.#G#G#.#G#
#GG.GGG#G.GG#
#############
*/