#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class Trie {
public:
    class Node {
    public:
        std::unordered_map<int, Node*> next;
        long long height;
        bool is_end;

        Node(long long height) :height(height), is_end(false) {
        };

        void insert(int i, const std::string &s) {
            if (i >= s.size()) {
                is_end = true;
                return;
            }

            if (this->next[s[i]] == nullptr) {
                this->next[s[i]] = new Node(i + 1);
            }

            this->next[s[i]]->insert(i + 1, s);
        }

        bool find(int i, const std::string &s) {
            if (i >= s.size()) {
                return is_end;
            }

            if (this->next[s[i]] == nullptr) {
                return false;
            }

            this->next[s[i]]->find(i + 1, s);
        }
    };

public:
    Node *root;

    Trie() {
        root = new Node(0LL);
    }

    void insert(const std::string &word) {
        root->insert(0, word);
    }

    bool find(const std::string &word) {
        root->find(0, word);
    }

};

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

	LL N, L;
	cin >> N >> L;

    Trie trie;
    FOR(i, 0, N) {
        string s;
        cin >> s;
        trie.insert(s);
    }

    vector<LL> height;
    queue<Trie::Node*> que;
    que.emplace(trie.root);

    while (not que.empty()) {
        auto n = que.front(); que.pop();

        bool have_left = n->next['0'] != nullptr;
        bool have_right = n->next['1'] != nullptr;

        if (not have_left and not have_right) {
            continue;
        }

        if (have_left) {
            que.emplace(n->next['0']);
        }
        else {
            height.emplace_back(L - n->height);
        }

        if (have_right) {
            que.emplace(n->next['1']);
        }
        else {
            height.emplace_back(L - n->height);
        }
    }

    LL ans = 0;
    FOE(h, height) {
        ans ^= (1LL << __builtin_ctzll(h));
    }

    if (ans != 0) {
        print("Alice");
    }
    else {
        print("Bob");
    }

	return 0;
}

Measured memory_bytes: 22372