#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second

ll n, l;
char buf[100010];

int pnxt[100001][2];
int dep[100001];
char term[100010];
const int root = 1;
int pn = root;

ll ans;

void dfs(int x){
	if(term[x]) return;
	for(int d=0; d<2; ++d){
		if(pnxt[x][d]) dfs(pnxt[x][d]);
		else {
			ll df = l-dep[x];
			ans ^= (df&-df);
		}
	}
}

int main()
{
	read(n, l);
	for(;n--;){
		scanf("%s", buf);
		int p = root;
		for(int i=0; buf[i]; ++i){
			int& nxt = pnxt[p][buf[i]-'0'];
			if(!nxt) dep[nxt = ++pn] = dep[p]+1;
			p = nxt;
		}
		term[p] = 1;
	}
	dfs(root);
	puts(ans?"Alice":"Bob");
	return 0;
}
