#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define MTP make_tuple
typedef long long int ll;

constexpr int kN = int(1E3 + 10), sq = 33;

inline int Mex(int a) {return a == 0 ? 1 : 0;}
inline int Mex(int a, int b) {
	if (a != 0 && b != 0) return 0;
	if (a != 1 && b != 1) return 1;
	return 2;
}
inline int Mex(int a, int b, int c) {
	if (a != 0 && b != 0 && c != 0) return 0;
	if (a != 1 && b != 1 && c != 1) return 1;
	if (a != 2 && b != 2 && c != 2) return 2;
	return 3;
}

struct Action {
	int val[4];
	Action() {}
	Action(int a) {
		for (int i = 0; i < 4; i++) val[i] = Mex(a, i);
	}
	Action operator () (Action a) const {
		Action ans;
		for (int i = 0; i < 4; i++) ans.val[i] = val[a.val[i]];
		return ans;
	}
	int operator () (int x) const {return val[x];}
};

Action apply(Action l, Action r) { // first l then r
	Action ans;
	for (int i = 0; i < 4; i++) ans.val[i] = r.val[l.val[i]];
	return ans;
}

int dp[kN][kN][3]; // 0 -> from i - 1, 1 -> from j - 1, 2 -> from j + 1
string s[kN];
Action action[kN], asq[kN], bsq[kN];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m, ans = 0;
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> s[i];
	if (m == 1) {
		dp[n][0][0] = 3;
		for (int i = n - 1; i >= 0; i--) if (s[i][0] == '#') dp[i][0][0] = 3;
		else dp[i][0][0] = Mex(dp[i + 1][0][0]);
	}
	else if (m == 2) {
		dp[n][0][0] = dp[n][1][0] = 3;
		for (int i = n - 1; i >= 0; i--) {
			if (s[i][0] == '#' && s[i][1] == '#') dp[i][0][0] = dp[i][1][0] = 3;
			else if (s[i][0] == '#') {
				dp[i][0][0] = 3;
				dp[i][1][0] = Mex(dp[i + 1][1][0]);
			}
			else if (s[i][1] == '#') {
				dp[i][0][0] = Mex(dp[i + 1][0][0]);
				dp[i][1][0] = 3;
			}
			else {
				dp[i][0][0] = Mex(dp[i + 1][0][0], Mex(dp[i + 1][1][0]));
				dp[i][1][0] = Mex(dp[i + 1][1][0], Mex(dp[i + 1][0][0]));
			}
		}
	}
	else {
		for (int i = 0; i < m; i++) dp[n][i][0] = 3;
		for (int i = n - 1; i >= 0; i--) {
			int idx = -1;
			for (int j = 0; j < m; j++) if (s[i][j] == '#') idx = j;
			if (idx >= 0) {
				dp[i][idx][0] = dp[i][idx][1] = dp[i][idx][2] = 3;
				for (int j = 1; j < m; j++) {
					int now = (j + idx) % m, lst = (j + idx - 1) % m;
					if (s[i][now] == '#') dp[i][now][2] = 3;
					else dp[i][now][2] = Mex(dp[i][lst][2], dp[i + 1][now][0]);
				}
				for (int j = 1; j < m; j++) {
					int now = (idx + m - j) % m, lst = (idx + m - j + 1) % m;
					if (s[i][now] == '#') dp[i][now][1] = 3;
					else dp[i][now][1] = Mex(dp[i][lst][1], dp[i + 1][now][0]);
				}
				for (int j = 0; j < m; j++) {
					if (s[i][j] == '#') dp[i][j][0] = 3;
					else dp[i][j][0] = Mex(dp[i + 1][j][0], dp[i][(j + 1) % m][1], dp[i][(j + m - 1) % m][2]);
				}
			}
			else {
				for (int j = 0; j < m; j++) action[j] = Action(dp[i + 1][j][0]);
				for (int j = 0; j < m; j += sq) {
					bsq[j] = action[j];
					for (int k = j + 1; k < j + sq && k < m; k++) bsq[j] = action[k](bsq[j]);
				}

				for (int j = sq - 1; j < m; j += sq) {
					asq[j] = action[j];
					for (int k = j - 1; k > j - sq; k--) asq[j] = action[k](asq[j]);
				}

				for (int j = 0; j < m; j++) {
					Action a = action[(j + m - 1) % m], b = action[(j + 1) % m];

					for (int k = 1; k < m - 1; k++) {
						if (((j + m - 1 - k) % m) % sq == sq - 1 && k + sq <= m - 1) {
							a = asq[(j + m - 1 - k) % m](a);
							k += sq - 1;
						}
						else a = action[(j + m - 1 - k) % m](a);
					}

					for (int k = 1; k < m - 1; k++) {
						if (((j + k + 1) % m) % sq == 0 && k + sq <= m - 1 && (j + k + 1) % m + sq <= m) {
							b = bsq[(j + k + 1) % m](b);
							k += sq - 1;
						}
						else b = action[(j + k + 1) % m](b);
					}
					dp[i][j][0] = Mex(dp[i + 1][j][0], a(3), b(3));
				}
			}
		}
	}

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

	if (ans) printf("Alice\n");
	else printf("Bob\n");
}