#include <bits/stdc++.h>
#define N 1005
#define pb push_back
using namespace std;

int n, m, R, C, id[N][N], col[N*N];
int dx[] = {1, 1, -1, -1}, dy[] = {1, -1, 1, -1};
char s[N][N];
vector<int> E[N*N];

inline bool ok(int x, int y) {
    return 1 <= x && x <= n && 1 <= y && y <= m && s[x][y] != '#';
}

void dfs(int x) {
    for (auto y : E[x]) {
        if (col[y] == -1) {
            col[y] = col[x]^1;
            dfs(y);
        }
    }
}

int main() {
    scanf("%d %d %d %d", &n, &m, &R, &C);
    if (!R && !C) {
        puts("Bob"); return 0;
    }
    int tot = 0, A = 0, B = 0;
    for (int i = 1; i <= n; i++) {
        scanf("%s", s[i]+1);
        for (int j = 1; j <= m; j++) if (s[i][j] != '#') {
            id[i][j] = ++tot;
            if (s[i][j] == 'A') A = tot;
            else if (s[i][j] == 'B') B = tot;
        }
    }
    for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) {
        for (int d = 0; d < 4; d++) {
            int p = i+dx[d]*R, q = j+dy[d]*C;
            if (ok(p, q)) E[id[i][j]].pb(id[p][q]);
        }
        for (int d = 0; d < 4; d++) {
            int p = i+dx[d]*C, q = j+dy[d]*R;
            if (ok(p, q)) E[id[i][j]].pb(id[p][q]);
        }
    }
    memset(col, -1, sizeof(col));
    int now = 0;
    for (int i = 1; i <= tot; i++) if (col[i] == -1) {
        col[i] = now; dfs(i); now += 2;
    }
    bool flg = 1;
    for (auto y : E[A]) if (y != B) flg = 0;
    if (flg) puts("Bob");
    else if (col[A]/2 != col[B]/2) puts("Alice");
    else if (col[A] == col[B]) puts("Alice");
    else puts("Bob"); 
    return 0;
}