#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N 200010
int t[N][2],len[N],ttop=0;
ll n,L,ans=0;
void Ins(int a){
	t[ttop][0]=0,t[ttop][1]=0;
	len[ttop]=a;
	ttop++;
}
ll g(ll k){
	int a=1;
	while(k%2==0)k/=2,a++;
	return a;
}
int main(){
	cin>>n>>L;
	Ins(0);
	lol(u,n){
		string s;cin>>s;
		int now=0;
		lol(i,s.size()){
			if(!t[now][s[i]-'0']){
				t[now][s[i]-'0']=ttop;
				Ins(i+1);
			}
			now=t[now][s[i]-'0'];
		}
	}
	lol(i,ttop){
		if(t[i][0]==0^t[i][1]==0){
			ans^=g(L-len[i]);
		}
	}
	cout<<(ans?"Alice":"Bob")<<endl;
	return 0;
}
