#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 1000;
int n, m;
char mp[maxn + 5][maxn + 5];
int f[maxn + 5][maxn + 5];
int l[maxn + 5], r[maxn + 5];
int f1[maxn + 5][3], f2[maxn + 5][3], b1[maxn + 5][3], b2[maxn + 5][3];
int mt[4][4][4];
int lst[maxn + 5], nxt[maxn + 5];
void init() {
	for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) for (int k = 0; k < 4; k++)
		for (int v = 0;; v++)
			if (i != v && j != v && k != v) { mt[i][j][k] = v; break; }
	iota(lst + 1, lst + m, 0), lst[0] = m - 1;
	iota(nxt, nxt + m - 1, 1), nxt[m - 1] = 0;
}
inline int mex(int a, int b = 3, int c = 3) { return mt[a][b][c]; }
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%s", mp[i]);
	init();
	fill(f[n + 1], f[n + 1] + m, 3);
	iota(f1[0], f1[0] + 3, 0), iota(f2[0], f2[0] + 3, 0),
	iota(b1[m - 1], b1[m - 1] + 3, 0), iota(b2[m - 1], b2[m - 1] + 3, 0);
	for (int i = n; i; i--) {
		bool flg = 0;
		for (int j = 0; j < m; j++) flg |= mp[i][j] == '#';
		if (flg) {
			int L, R = m;
			for (L = 0; mp[i][L] != '#'; L++) ;
			fill(l, l + m, 3), fill(r, r + m, 3);
			for (;; L = R) {
				for (R = nxt[L]; mp[i][R] != '#'; R = nxt[R]) ;
				for (int j = nxt[L]; j != R; j = nxt[j]) l[j] = mex(l[lst[j]], f[i + 1][j]);
				for (int j = lst[R]; j != L; j = lst[j]) r[j] = mex(r[nxt[j]], f[i + 1][j]);
				if (R <= L) break;
			}
			for (int j = 0; j < m; j++) {
				if (mp[i][j] == '#') f[i][j] = 3;
				else f[i][j] = mex(f[i + 1][j], l[lst[j]], r[nxt[j]]);
			}
		} else {
			if (m == 1) { f[i][0] = mex(f[i + 1][0]); continue; }
			for (int j = 1; j < m; j++)
				for (int k = 0; k < 3; k++) {
					f1[j][k] = mex(f1[j - 1][k], f[i + 1][j]);
					f2[j][k] = f2[j - 1][mex(k, f[i + 1][j - 1])];
				}
			for (int j = m - 2; ~j; j--)
				for (int k = 0; k < 3; k++) {
					b1[j][k] = mex(b1[j + 1][k], f[i + 1][j]);
					b2[j][k] = b2[j + 1][mex(k, f[i + 1][j + 1])];
				}
			f[i][0] = mex(f[i + 1][0], b1[1][mex(f[i + 1][m - 1])], b2[1][mex(f[i + 1][1])]);
			f[i][m - 1] = mex(f[i + 1][m - 1], f1[m - 2][mex(f[i + 1][0])], f2[m - 2][mex(f[i + 1][m - 2])]);
			for (int j = 1; j < m - 1; j++)
				f[i][j] = mex(f[i + 1][j], f1[j - 1][mex(f[i + 1][0], b2[j + 1][mex(f[i + 1][j + 1])])],
										   b1[j + 1][mex(f[i + 1][m - 1], f2[j - 1][mex(f[i + 1][j - 1])])]);
		}
	}
	int sum = 0;
	for (int i = 1; i <= n; i++)
		for (int j = 0; j < m; j++)
			if (mp[i][j] == 'B') sum ^= f[i][j];
	printf("%s", sum ? "Alice" : "Bob");
}