#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn = 1000005;
template <typename T>
void read(T &x) {
	T flg = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') flg = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= flg;
}
int n, m, r, c;
int dx[4] = {1, 1, -1, -1};
int dy[4] = {1, -1, 1, -1};
char mp[1005][1005];
int sa, sb;
vector<int> vec[maxn];
bool check(int x, int y) {
	if (x < 1 || x > n || y < 1 || y > m) return false;
	if (mp[x][y] == '@') return false;
	return true;
}
bool judge(int x) {
	for (int y : vec[x]) {
		int i = (y + m - 1) / m, j = y - (i - 1) * m;
		if (mp[i][j] == '.') return true;
	}
	return false;
}
int pos[maxn], col[maxn], zz;
void dfs(int u, int cc) {
	pos[u] = zz;
	col[u] = cc;
	for (int v : vec[u]) {
		if (pos[v] == -1) dfs(v, cc ^ 1);
	}
}
int main() {
	read(n); read(m); read(r); read(c);
	for (int i = 1; i <= n; i++) {
		scanf("%s", mp[i] + 1);
		for (int j = 1; j <= m; j++) {
			if (mp[i][j] == 'A') {
				sa = (i - 1) * m + j;
			}
			if (mp[i][j] == 'B') {
				sb = (i - 1) * m + j;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (mp[i][j] != '@') {
				for (int k = 0; k < 4; k++) {
					int x = i + r * dx[k], y = j + c * dy[k];
					if (check(x, y)) {
						vec[(i - 1) * m + j].pb((x - 1) * m + y);
					}
					x = i + c * dx[k], y = j + r * dy[k];
					if (check(x, y)) {
						vec[(i - 1) * m + j].pb((x - 1) * m + y);
					}
				}
			}
		}
	}
	if (!judge(sa)) {
		puts("Bob");
	} else {
		for (int i = 1; i <= n * m; i++) pos[i] = -1;
		for (int i = 1; i <= n * m; i++) {
			if (pos[i] == -1) {
				zz++;
				dfs(i, 0);
			}
		}
		if (pos[sa] != pos[sb]) puts("Alice");
		else if (col[sa] == col[sb]) puts("Alice");
		else puts("Bob");
	}
	return 0;
}