#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {if (a > b) a = b;}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {if (a < b) a = b;}
void fail() { cout << -1 << endl; exit(0); }

typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 998244353;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

struct Trie {
	bool f;
	Trie *par;
	Trie *next[2];
	Trie(){f = 0; par = (Trie*)0; fill(next, next + 2, (Trie*)0); }
};
Trie *ins(string t, Trie *r) {
	for (int i = 0; i < t.size(); i++) {
		int c = t[i] - '0';
		if (!r->next[c])r->next[c] = new Trie;
		r->next[c]->par = r;
		r = r->next[c];
		r->f = 1;
	}
	return r;
}

ll grundy(int d) {
	int ret = 1;
	while (d % 2 == 0) {
		ret *= 2;
		d /= 2;
	}
	return ret;
}

void solve() {
	int N, L; cin >> N >> L;
	Trie *r = new Trie();
	vector<string>S(N);
	vector<Trie*>p(N);
	REP(i, N) {
		cin >> S[i];
		p[i] = ins(S[i], r);
	}
	int g = 0;
	REP(i, N) {
		Trie *cur = p[i];
		int id = S[i].size() - 1;
		while (true) {
			//兄弟ノードの部分木が空いているか調べる
			cur = cur->par;
			int c = S[i][id] - '0';
			if (!cur->next[c ^ 1]) {
				if (!cur->next[c ^ 1]) {
					cur->next[c ^ 1] = new Trie();
					cur->next[c ^ 1]->f = 1;
				}
				g ^= grundy(L - id);
			}
			if (cur == r)break;
			id--;
		}
	}
	if (g != 0)print("Alice");
	else print("Bob");
} 





signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	mt.seed((int)(time(0)));
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}



Measured memory_bytes: 13076