Problem: For strings s and t, we will say that s and t are prefix-free when neither is a prefix of the other.

Let L be a positive integer. A set of strings S is a good string set when the following conditions hold true:

* Each string in S has a length between 1 and L (inclusive) and consists of the characters `0` and `1`.
* Any two distinct strings in S are prefix-free.



We have a good string set S = \\{ s_1, s_2, ..., s_N \\}. Alice and Bob will play a game against each other. They will alternately perform the following operation, starting from Alice:

* Add a new string to S. After addition, S must still be a good string set.



The first player who becomes unable to perform the operation loses the game. Determine the winner of the game when both players play optimally.

Constraints

* 1 \leq N \leq 10^5
* 1 \leq L \leq 10^{18}
* s_1, s_2, ..., s_N are all distinct.
* { s_1, s_2, ..., s_N } is a good string set.
* |s_1| + |s_2| + ... + |s_N| \leq 10^5

Input

Input is given from Standard Input in the following format:


N L
s_1
s_2
:
s_N


Output

If Alice will win, print `Alice`; if Bob will win, print `Bob`.

Examples

Input

2 2
00
01


Output

Alice


Input

2 2
00
11


Output

Bob


Input

3 3
0
10
110


Output

Alice


Input

2 1
0
1


Output

Bob


Input

1 2
11


Output

Alice


Input

2 3
101
11


Output

Bob

Solution (in CPP):

Solution:
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <map>

using namespace std;

struct Trie {
  Trie *children[2];
  Trie() {
    fill(children, children+2, nullptr);
  }
  void add(const string &s) {
    Trie *cur = this;
    for (char ch : s) {
      int d = ch - '0';
      if (!cur->children[d]) {
        cur->children[d] = new Trie();
      }
      cur = cur->children[d];
    }
  }
};

long long dfs(Trie *r, int lv, long long L) {
  if (lv == L) {
    return 0;
  }
  if (!r->children[0] && !r->children[1]) {
    return 0;
  }
  long long Xor = 0;
  for (int d = 0; d < 2; d++) {
    if (r->children[d]) {
      Xor ^= dfs(r->children[d], lv + 1, L);
    } else {
      long long h = L - (lv + 1);
      int p = 0;
      while (h % 2) {
        p++;
        h /= 2;
      }
      Xor ^= (1LL << p);
    }
  }
  return Xor;
}

const int N = int(1e5);
char s[N+1];

int main(void) {
  int n; long long L;
  scanf("%i %lld", &n, &L);
  
  Trie *tree = new Trie();
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    tree->add(string(s));
  }
  
  puts(dfs(tree, 0, L) ? "Alice" : "Bob");
  
  return 0;
}