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

#define ll long long 
const int MAXN = 1e5 + 5;
int NUM_NODE = 1;

int n;
ll L;
char str[MAXN];
int depth[MAXN], nex[MAXN][2];
ll ans;

ll getGrundy(ll x){
	if(x <= 0)
		return 0;
	for(int i = 60; i >= 0; --i){
		if((x%(1LL<<i)) == 0)
			return (1LL<<i);
	}
	return 1;
}

int main(){
	memset(nex, -1, sizeof nex);
	scanf("%d%*c%lld%*c", &n, &L);
	for(int i = 0; i < n; ++i){
		scanf("%[^\n]%*c", str);
		int curPos = 0, j = 0;
		while(str[j] != '\0'){
			int ch = str[j]-'0';
			// printf("(%c)", str[j]);
			if(nex[curPos][ch] == -1){
				depth[NUM_NODE] = depth[curPos]+1;
				// printf("Depth[%d] = %d\n", NUM_NODE, depth[NUM_NODE]);
				nex[curPos][ch] = NUM_NODE++;
			}
			curPos = nex[curPos][ch];
			++j;
		}
		// printf("\n");
	}
	for(int i = 0; i < NUM_NODE; ++i){
		if(nex[i][0] == -1){
			ans ^= getGrundy(L-depth[i]);
			// printf("%lld (%lld\n", L-depth[i], getGrundy(L-depth[i]));
		}
		if(nex[i][1] == -1){
			ans ^= getGrundy(L-depth[i]);
			// printf("%lld (%lld\n", L-depth[i], getGrundy(L-depth[i]));
		}
	}
	// printf("%lld\n", ans);
	if(ans)
		printf("Alice\n");
	else
		printf("Bob\n");
}