#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


class Node {
public:
    int depth;
    bool marked, passed;
    Node *zero, *one;
public:
    Node(int depth) : depth(depth) {
        marked = passed = false;
        zero = one = NULL;
    }
    ~Node() {
        if (zero) delete zero;
        if (one) delete one;
    }
};
class Trie {
    ll L;
    Node* root;
 public:
    Trie(ll L) : L(L) {
        root = new Node(0);
        root->zero = new Node(1);
        root->one = new Node(1);
    }
    ~Trie() {
        delete root;
    }
    void add(string& s){
        Node *n = root;
        int sz = s.size();
        for (int i=0; i<sz; ++i) {
            if (!n->zero && 1+i<=L) n->zero = new Node(1+i);
            if (!n->one && 1+i<=L) n->one = new Node(1+i);
            n->passed = true; //
            if (s[i] == '0') {
                n = n->zero;
            } else if (s[i] == '1') {
                n = n->one;
            }
        }
        n->marked = true;
    }
    vector<ll> available() {
        vector<ll> res;
        queue<Node*> q;
        q.push(root);
        while (!q.empty()) {
            Node *n = q.front();
            q.pop();
            if (n->marked) continue;
            if (n->passed) {
                if (n->zero) q.push(n->zero);
                if (n->one) q.push(n->one);
            } else {
                res.pb(L - n->depth + 1);
            }
        }
        return res;
    }
};


template <typename T>
bool nim(vector<T>& gs) {
    T a = accumulate(ALL(gs), (T)0, [](T x, T y){ return x ^ y; });
    return a != (T)0;
}

template <typename T>
bool nim(vector<T>& gs, function<T(T)> grundy_proc) {
    T a = accumulate(ALL(gs), (T)0, [grundy_proc](T x, T y){ return x ^ grundy_proc(y); });
    return a != (T)0;
}


bool solve(int N, ll L, vector<string>& s) {
    Trie trie(L);
    rep(i,N) trie.add(s[i]);
    vector<ll> available = trie.available();
    return nim<ll>(available, [](ll x){return x & -x;});
}

int main() {
    int N; ll L; cin >> N >> L;
    vector<string> s(N);
    rep(i,N) cin >> s[i];
    cout << (solve(N,L,s) ? "Alice":"Bob") << endl;
    return 0;
}


Measured memory_bytes: 8040