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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;













struct node {
    node *ch[2];
    node() {
	ch[0]=ch[1]=NULL;
    }
};






ll n, l;
node *trie;


void add(string s) {
    node *cur = trie;
    for (char c: s) {
	if (cur->ch[c-'0'] == NULL) cur->ch[c-'0'] = new node();
	cur = cur->ch[c-'0'];
    }
}

ll G;

void dfs(node *at, int len=0) {
    if (len == l) return;
    int count = 0;
    if (at->ch[0] == NULL) count++;
    if (at->ch[1] == NULL) count++;

    if (count == 1) {
        ll cur = l-len;
	ll res = 1;
	while (cur%2 == 0) {
	    res=res*2;
	    cur=cur/2;
	}
	G = G ^ res;
    }

    for (int i=0; i<2; i++) {
	if (at->ch[i] != NULL) {
	    dfs(at->ch[i], len+1);
	}
    }
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
    trie=new node();
    cin>>n>>l;
    for (int i=0; i<n; i++) {
	string s; cin>>s;
	add(s);
    }

    dfs(trie);



    if (G==0) out("Bob");
    out("Alice");

    

    return 0;
}
