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

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

const int N = 1000 + 7;
const int inf = 1e9 + 7;

const int T = 1 << 10;

int mex(set<int> S) {
	int res = 0;
	while (S.count(res))
		res++;
	return res;
}

struct Node {
	int L[3], R[3];

	Node(int down = 0) {
		for (int i = 0; i < 3; i++) {
			L[i] = R[i] = mex({down, i});
		}
	}
} tree[T << 1];

Node operator+ (const Node& A, const Node& B) {
	Node C;

	for (int i = 0; i < 3; i++) {
		C.L[i] = B.L[A.L[i]];
		C.R[i] = A.R[B.R[i]];
	}

	return C;
}

void update(int p, int v) {
	tree[p += T] = Node(v);
	for (; p >>= 1; )
		tree[p] = tree[p << 1 | 0] + tree[p << 1 | 1];
}

Node query(int l, int r) {
	Node resL, resR;

	for (int i = 0; i < 3; i++) {
		resL.L[i] = resL.R[i] = 2;
		resR.L[i] = resR.R[i] = 2;
	}
	
	if (l > r)
		return resL;

	for (l += T, r += T + 1; l < r; l >>= 1, r >>= 1) {
		if (l & 1)
			resL = resL + tree[l++];
		if (r & 1)
			resR = tree[--r] + resR;
	}

	return resL + resR;
}

int h, w;
string s[N];
int l[N][N], r[N][N];
int nim[N][N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> h >> w;
	rep(i, h)	cin >> s[i];

	rep(i, w)	nim[h][i] = inf;

	for (int i = h - 1; i >= 0; i--) {
		if (w == 1) {
			if (s[i][0] == '#')
				nim[i][0] = inf;
			else
			if (nim[i + 1][0] == 0)
				nim[i][0] = 1;
			else
				nim[i][0] = 0;
			
			continue;
		}

		int first_hash = -1;
		rep(j, w) {
			if (s[i][j] == '#') {
				first_hash = j;
				break;
			}
		}

		if (first_hash == -1) {
			rep(j, w) {
				update(j, nim[i + 1][j]);
			}

			rep(j, w) {
				Node u = query(j + 1, w - 1) + query(0, j - 1);
				nim[i][j] = mex({nim[i + 1][j], u.L[2], u.R[2]});
			}
		}
		else {
			{
				l[i][first_hash] = inf;
				int j = first_hash;
				do {
					int prv_j = j;
					j = (j + 1) % w;
					if (s[i][j] == '#') {
						l[i][j] = inf;
					}
					else {
						l[i][j] = mex({l[i][prv_j], nim[i + 1][j]});
					}
				} while (j != first_hash);
			}
			
			{
				r[i][first_hash] = inf;
				int j = first_hash;
				do {
					int prv_j = j;
					j = (j + w - 1) % w;
					if (s[i][j] == '#') {
						r[i][j] = inf;
					}
					else {
						r[i][j] = mex({r[i][prv_j], nim[i + 1][j]});
					}
				} while (j != first_hash);
			}

			rep(j, w) {
				if (s[i][j] == '#')
					nim[i][j] = inf;
				else
					nim[i][j] = mex({nim[i + 1][j], l[i][(j + w - 1) % w], r[i][(j + 1) % w]});
			}
		}
	}

	int ans = 0;

	/*
	cerr << "nim:\n";
	rep(i, h) {
		rep(j, w)
			cerr << nim[i][j] << ' ';
		cerr << '\n';
	}
	// */

	rep(i, h) rep(j, w)
		if (s[i][j] == 'B')
			ans ^= nim[i][j];

	if (ans)
		cout << "Alice\n";
	else
		cout << "Bob\n";

	return 0;
}