#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <random>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<n;i++)
#define srep(i,a,n)	for(int i=a;i<n;i++)
#define REP(i,n)	for(int i=0;i<=n;i++)
#define SREP(i,a,n)	for(int i=a;i<=n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
#define fst	first
#define scn second
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll gcd(ll a, ll b) {
	return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	cout<<"case #" << x << ": " << endl
#define DEBUG 0
const ll inf = (ll)1e9;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };

vector<string> s;

bool com(string i, string j) {
	if (i.length() != j.length())	return i.length() < j.length();
	else	return i < j;
}

int findstr(int i) {
	s[i][s[i].size() - 1] = '1' + '0' - s[i][s[i].size() - 1];
	if (i > 0 && s[i] == s[i - 1]) {
		s[i][s[i].size() - 1] = '1' + '0' - s[i][s[i].size() - 1];
		return i - 1;
	}
	if (i + 1 < s.size() && s[i] == s[i + 1]) {
		s[i][s[i].size() - 1] = '1' + '0' - s[i][s[i].size() - 1];
		return i + 1;
	}
	s[i][s[i].size() - 1] = '1' + '0' - s[i][s[i].size() - 1];
	return -1;
}

int main() {
	int n;	ll l;	cin >> n >> l;
	s.resize(n);
	rep(i, n)	cin >> s[i];
	sort(s.begin(), s.end(), com);
	ll grundy = 0;
	while (s.size() > 0) {
		int i = s.size() - 1;
		int idx = findstr(i);
		if (idx != -1) {
			s[idx].pop_back();
			s.erase(s.begin()+i);
		}
		else {
			s[i].pop_back();
			ll x = l - s[i].size();
			grundy ^= x - (x&(x - 1));
			idx = i;
		}
		if(idx>0) {
			string tmp = s[idx];
			s.erase(s.begin() + idx);
			int left = 0, right = idx;
			rep(t, 20) {
				int mid = (left + right) / 2;
				if (s[mid].size() < tmp.size())	left = mid;
				else if (s[mid].size() > tmp.size())	right = mid;
				else if (s[mid] < tmp)	left = mid;
				else if (s[mid] > tmp)	right = mid;
			}
			s.insert(s.begin() + right, tmp);
		}
		else if (s[idx] == "")	break;
	}
	cout << (grundy == 0 ? "Bob" : "Alice") << endl;
	return 0;
}

Measured memory_bytes: 640