#include <bits/stdc++.h>
#define rep(i,  x,  y) for(int i = x; i <= y; i ++)
#define ll long long
#define X first
#define Y second
#define ls rt << 1
#define rs rt << 1 | 1
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
inline int read()
{
	int x = 0, f = 1; char ch = getchar();
	while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
int n;
ll l;
string s;

int nxt[200010][2], tail = 1;
ll ans;

ll sg(int dep)
{
	ll rem = l - dep + 1;
	return rem & -rem;
}

void dfs(int cur, int dep)
{
	for(int i = 0; i < 2; i ++)
		if (nxt[cur][i] == -1) ans ^= sg(dep);
		else dfs(nxt[cur][i], dep+1);
}

int main()
{
	memset(nxt, -1, sizeof nxt);
	cin >> n >> l;
	for(int i = 0; i < n; i ++)
	{
		cin >> s;
		int it = 0;
		for(int j = 0; j < s.size(); j ++)
		{
			int dir = s[j] - '0';
			if (nxt[it][dir] == -1) nxt[it][dir] = tail++;
			it = nxt[it][dir];
		}
	}
	ans = 0LL;
	dfs(0, 1);
	puts(ans == 0 ? "Bob" : "Alice");

	return 0;
}
