#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010;
int n,m,r,c,t;
int vis[N][N];
char s[N][N];
PII q[N*N],p1,p2;
int main() {
	scanf("%d%d%d%d",&n,&m,&r,&c);
	if (r==0&&c==0) {
		puts("Bob");
		return 0;
	}
	rep(i,0,n) scanf("%s",s[i]);
	rep(i,0,n) rep(j,0,m) {
		if (s[i][j]=='A') p1=mp(i,j);
		if (s[i][j]=='B') p2=mp(i,j);
	}
	int dx[]={r,r,c,c,-r,-r,-c,-c};
	int dy[]={c,-c,r,-r,c,-c,r,-r};
	bool go=0;
	rep(i,0,8) {
		int nx=p1.fi+dx[i],ny=p1.se+dy[i];
		if (nx>=0&&nx<n&&ny>=0&&ny<m&&s[nx][ny]=='.') go=1;
	}
	if (!go) {
		puts("Bob");
		return 0;
	}
	memset(vis,-1,sizeof(vis));
	q[t++]=p1;
	vis[p1.fi][p1.se]=0;
	rep(i,0,t) {
		int x=q[i].fi,y=q[i].se;
		rep(j,0,8) {
			int nx=x+dx[j],ny=y+dy[j];
			if (nx>=0&&nx<n&&ny>=0&&ny<m&&s[nx][ny]!='@'&&vis[nx][ny]==-1) {
				vis[nx][ny]=vis[x][y]^1;
				q[t++]=mp(nx,ny);
			}
		}
	}
	puts(vis[p2.fi][p2.se]==1?"Bob":"Alice");
}