#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>

using namespace std;
using ll = long long;

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

#define REP(i,n) for(int i = 0; i < int(n); i++)
#define FOR(i, m, n) for(int i = int(m);i < int(n);i++)
#define ALL(obj) (obj).begin(),(obj).end()

const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template<class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl;exit(0);}else return;}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b) { a = max<T>(a, b); }
template <class T> void chmin(T& a, const T b) { a = min<T>(a, b); }
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

struct node{
	int l, r;
	ll depth;
	node(ll n){
		l = r = -1;
		depth = n;
	}
};

int main() {
	ll N, L;
	cin >> N >> L;
	V<node> tree;
	node zero(0);
	tree.push_back(zero);
	
	while(N--){
		string S;
		cin >> S;
		int p = 0;
		for(int j = 0; j < S.size(); ++j){
			if(S[j]=='0'){
				if(tree[p].l == -1) {
					node next(j + 1);
					tree.push_back(next);
					tree[p].l = tree.size() - 1;
				}
				p = tree[p].l;
			}
			else{
				if (tree[p].r == -1) {
					node next(j + 1);
					tree.push_back(next);
					tree[p].r = tree.size() - 1;
				}
				p = tree[p].r;		
			}
		}	
	}
	V<ll> subtree;
	for(auto e:tree){
		if (e.l == -1 && e.r == -1) continue;
		if (e.l != -1 && e.r != -1) continue;
		subtree.push_back(L - e.depth);
	}
	V<ll> pow2(50,1);
	for (int i = 1; i < 50; ++i) pow2[i] = pow2[i - 1] * 2;
	ll ans = 0;
	for(auto e:subtree){
		for(int i = 49; 0 <= i; --i){
			if(e%pow2[i]==0){
				ans ^= pow2[i];
				break;
			}
		}
	}
	cout << (ans ? "Alice" : "Bob") << endl;
	cin >> N;
	return 0;
}



Measured memory_bytes: 3568