#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;

int n, ch[N][2], en[N];
ll L, ans;
int cn;

void add(string &s){
    int node = 0;
    for(auto &i : s){
        int x = i - '0';
        if(ch[node][x] == -1){
            ch[node][x] = ++cn;
        }
        node = ch[node][x];
    }
    en[node] = 1;
}
void go(int node, ll dep){
    if(en[node]) return;
    if(ch[node][0] == -1) ans ^= dep ^ -dep;
    else go(ch[node][0], dep - 1);
    if(ch[node][1] == -1) ans ^= dep ^ -dep;
    else go(ch[node][1], dep - 1);
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(ch, -1, sizeof ch);
    cin >> n >> L;
    for(int i = 0 ; i < n ; i++){
        string s;
        cin >> s;
        add(s);
    }
    go(0, L);
    if(ans) cout << "Alice\n";
    else cout << "Bob\n";
}
