#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
struct Node {
	bool last;
	int childs[2];
	Node() {
		last = false;
		memset(childs, -1, sizeof(childs));
	}
};

class trie_tree {
	vector<Node> nodes;

	int add_node() {
		nodes.push_back(Node());
		return sz(nodes) - 1;
	}

public:
	trie_tree() {
		clear();
	}

	void clear() {
		nodes.clear();
		add_node();
	}

	int add(const char* s) {
		int cur = 0;
		for (int i = 0; s[i]; i++) {
			int nxt = nodes[cur].childs[s[i] - '0'];
			if (nxt == -1) {
				nxt = add_node();
				nodes[cur].childs[s[i] - '0'] = nxt;
			}
			cur = nxt;
		}
		nodes[cur].last = true;
		return cur;
	}

	void dfs(int v, int dep, set<ll>& ret) {
		FOR(i, 2) {
			if (nodes[v].childs[i] == -1) {
				if (ret.count(dep + 1)) {
					ret.erase(dep + 1);
				} else {
					ret.insert(dep + 1);
				}
			} else {
				dfs(nodes[v].childs[i], dep + 1, ret);
			}
		}
	}

	set<ll> get(ll mxlen) {
		set<ll> ret;
		dfs(0, 0, ret);
		if (ret.count(mxlen + 1)) {
			ret.erase(mxlen + 1);
		}

		set<ll> ret2;
		for (auto x : ret) {
			ret2.insert(mxlen - x);
		}

		return ret2;
	}
};

void test() {
	int memo[1 << 16] = {};
	memo[0] = 0;
	FOR(i, 1 << 16) {
		set<int> st;
		FOR(j, 16) if (i & (1 << j)) {
			for (int k = -1; k < j; k++) {
				int flip = ((1 << (j + 1)) - (1 << (k + 1)));
				int ni = i ^ (flip);
				st.insert(memo[ni]);
			}
		}
		int val = 0;
		while (st.count(val)) val++;
		//if (val == 0) {
		//	string s;
		//	int nn = i;
		//	while (nn) {
		//		s.push_back(nn % 2 + '0');
		//		nn /= 2;
		//	}
		//	reverse(s.begin(), s.end());
		//	printf("%10d: %s\n", i, s.c_str());
		//}
		memo[i] = val;
	}
	for (int i = 0; i < 15; i++) {
		printf("%d : %d\n", i, memo[1 << i]);
	}
}

int main() {
	// test();
	int n; ll l; reader(n, l);
	trie_tree tt;
	FOR(i, n) {
		string s; reader(s);
		tt.add(s.c_str());
	}

	auto s = tt.get(l);
	ll cnt = 0;
	for (auto x : s) {
		ll val = x + 1;
		ll ccnt = 1;
		while (val % 2 == 0) {
			val /= 2;
			ccnt *= 2;
		}
		cnt ^= ccnt;
	}
	bool ok =cnt != 0;
	puts(ok ? "Alice" : "Bob");

	return 0;
}


Measured memory_bytes: 12980