#include <bits/stdc++.h>
using namespace std;

const int maxn = 1025;
int dp[maxn][maxn];

using monoid = array<int,4>;

const monoid ID = {0, 1, 2, 3};

int mex(vector<int> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    for (int i = 0; i < (int)v.size(); i++)
        if (v[i] != i)
            return i;
    return (int)v.size();
}

monoid f(monoid lhs, monoid rhs) {
    monoid res;
    for (int j = 0; j < 4; j++)
        res[j] = rhs[lhs[j]];
    return res;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<string> s(N);
    for (int i = 0; i < N; i++) {
        cin >> s[i];
    }

    for (int j = 0; j < M; j++)
        dp[N][j] = 1e9;

    for (int i = N - 1; i >= 0; i--) {
        vector<monoid> a(M);

        for (int j = 0; j < M; j++) {
            if (s[i][j] == '#') {
                a[j] = {3, 3, 3, 3};
            } else {
                for (int t = 0; t < 4; t++) {
                    a[j][t] = mex({ t, dp[i + 1][j] });
                }
            }
        }

        vector<int> rig(M), lef(M);

        vector<monoid> pre(M + 1), suf(M + 1);
        {
            // go right
            pre[0] = ID;
            for (int j = 0; j < M; j++) {
                pre[j + 1] = f(pre[j], a[j]);
            }

            suf[M] = ID;
            for (int j = M - 1; j >= 0; j--) {
                suf[j] = f(a[j], suf[j + 1]);
            }

            for (int j = 0; j < M; j++) {
                rig[j] = f(suf[j + 1], pre[j])[3];
            }
        }

        {
            // go left
            pre[0] = ID;
            for (int j = 0; j < M; j++) {
                pre[j + 1] = f(a[j], pre[j]);
            }

            suf[M] = ID;
            for (int j = M - 1; j >= 0; j--) {
                suf[j] = f(suf[j + 1], a[j]);
            }

            for (int j = 0; j < M; j++) {
                lef[j] = f(pre[j], suf[j + 1])[3];
            }
        }


        for (int j = 0; j < M; j++) {
            dp[i][j] = mex({ rig[j], lef[j], dp[i + 1][j] });
        }
    }

    int ans = 0;

    for (int i = 0; i < N; i++)
        for (int j = 0; j < M; j++)
            if (s[i][j] == 'B')
                ans ^= dp[i][j];

    cout << (ans == 0 ? "Bob\n" : "Alice\n");

    return 0;
}