#include <bits/stdc++.h>
using namespace std;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m, a, b;
	cin >> n >> m >> a >> b;
	vector<array<int, 2>> dir{{a, b}, {a, -b}, {-a, b}, {-a, -b}, {b, a}, {b, -a}, {-b, a}, {-b, -a}};
	auto id = [&](int x, int y) { return x * m + y; };
	vector<vector<char>> g(n, vector<char>(m));
	int pa = 0, pb = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> g[i][j];
			if (g[i][j] == 'A') pa = id(i, j);
			if (g[i][j] == 'B') pb = id(i, j);
		}
	}
	vector<vector<int>> e(n * m);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (g[i][j] != '@') {
				for (auto [x, y] : dir) {
					int ni = i + x, nj = j + y;
					if (ni >= 0 && ni < n && nj >= 0 && nj < m && g[ni][nj] != '@') {
						e[id(i, j)].push_back(id(ni, nj));
					}
				}
			}
		}
	}
	if (e[pa].empty()) {
		cout << "Bob" << "\n";
		return 0;
	}
	int hpa = 0, hpb = 0;
	vector<int> col(n * m, -1);
	for (int i = 0; i < n * m; i++) {
		if (col[i] == -1) {
			static queue<int> q;
			col[i] = 0;
			q.push(i);
			while (!q.empty()) {
				int u = q.front();
				q.pop();
				hpa |= u == pa, hpb |= u == pb;
				for (int v : e[u]) {
					if (col[v] == -1) {
						col[v] = !col[u];
						q.push(v);
					} else assert(col[u] ^ col[v]);
				}
			}
			if (hpa ^ hpb) {
				cout << "Alice" << "\n";
				return 0;
			}
			if (hpa && hpb) {
				if (col[pa] == col[pb]) {
					cout << "Alice" << "\n";
				} else {
					cout << "Bob" << "\n";
				}
				return 0;
			}
		}
	}
	assert(false);
	return 0;
}