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

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

const int N = 1000 + 7;

int h, w;
string s[N];

vector<int> adj[N * N];
int mat[N * N];
int vis[N * N], col = 1;

const int dx[] = {-1, 0, +1, 0};
const int dy[] = {0, -1, 0, +1};

bool dfs(int u) {
	if (vis[u] == col)
		return false;
	vis[u] = col;

	for (int v : adj[u])
		if (mat[v] == -1) {
			mat[v] = u;
			mat[u] = v;
			return true;
		}
	
	for (int v : adj[u])
		if (dfs(mat[v])) {
			mat[v] = u;
			mat[u] = v;
			return true;
		}

	return false;
}

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

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

	rep(i, h) rep(j, w) {
		mat[i * w + j] = -1;

		if (s[i][j] == '#')
			continue;

		rep(d, 4) {
			int r = i + dx[d];
			int c = (j + dy[d]) % w;

			if (0 <= r && r < h && s[r][c] != '#' && (r != i || c != j)) {
				adj[i * w + j].push_back(r * w + j);
			}
		}
	}

	rep(i, h) rep(j, w) if (mat[i * w + j] == -1) {
		if (!dfs(i * w + j)) {
			col++;
			dfs(i * w + j);
		}
	}

	int won = 0;
	int lost = 0;
	
	rep(i, h) rep(j, w) {
		if (s[i][j] == 'B') {
			int u = i * w + j;
			if (mat[u] == -1) {
				lost++;
			}
			else {
				int v = mat[u];

				mat[u] = -1;
				mat[v] = -1;

				vis[u] = col;
				
				bool fail = false;
				for (int x : adj[u]) {
					if (dfs(x)) {
						fail = true;
						break;
					}
				}

				if (!fail) {
					vis[u] = ++col;
					for (int x : adj[u]) {
						if (dfs(x)) {
							fail = true;
							break;
						}
					}
				}

				if (fail)
					lost++;
				else
					won++;
			}
		}
	}

	// cerr << "won: " << won << '\n';
	// cerr << "lost: " << lost << '\n';

	if (won % 2 == 0)
		cout << "Bob\n";
	else
		cout << "Alice\n";

	return 0;
}