// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

const int N_AL = 2;
struct Trie{
  Trie *next[N_AL];
  bool exists = false;
  Trie(){
    for(int i = 0; i < N_AL; i++)next[i] = nullptr;
  }
  int get_index(const char c){
    if(c == '0')return 0;
    else return 1;
  }
  void insert(const string &s, int i){
    if(i == s.size()){
      exists = true;
      return;
    }
    int index = get_index(s[i]);
    if(!next[index]){
      next[index] = new Trie();
    }
    next[index]->insert(s, i+1);
  }
  void insert(const string &s){
    insert(s, 0);
  }
  bool find(const string &s, int i){
    if(i == s.size()){
      return exists;
    }
    int index = get_index(s[i]);
    if(next[index])return next[index]->find(s, i+1);
    return false;
  }
  bool find(const string &s){
    return find(s, 0);
  }
};

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll l;
  cin >> n >> l;
  Trie *root = new Trie();
  ll res = 0;
  rep(i, n){
    string s;
    cin >> s;
    root->insert(s);
  }
  queue<pair<Trie*, int>> q;
  q.push(mk(root, 0));
  while(!q.empty()){
    auto p = q.front(); q.pop();
    Trie *t = p.first;
    int h = p.SE;
    int cnt = 0;
    rep(i, 2)if(t->next[i])cnt++;
    if(cnt == 1){
      ll H = l - h;
      ll tmp = 1;
      while(H % 2 == 0){
        tmp *= 2;
        H /= 2;
      }
      res ^= tmp;
    }
    rep(i, 2){
      if(t->next[i]){
        q.push(mk(t->next[i], h + 1));
      }
    }
  }
  if(res == 0)cout << "Bob" << endl;
  else cout << "Alice" << endl;
  return 0;
}


Measured memory_bytes: 3536