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.

-----Sample Input-----
2 2
00
01

-----Sample Output-----
Alice

If Alice adds 1, Bob will be unable to add a new string.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "import sys\ninput=sys.stdin.readline\nsys.setrecursionlimit(10**9)\nfrom collections import deque\n\nclass Node:\n    def __init__(self,depth):\n        self.depth=depth\n        self.left=None\n        self.right=None\n\ndef insert(node,s):\n    n=node\n    for i in range(len(s)):\n        t=s[i]\n        if t=='0':\n            if n.left is None:\n                n.left=Node(i+1)\n            n=n.left\n        else:\n            if n.right is None:\n                n.right=Node(i+1)\n            n=n.right\n\nclass Trie:\n    def __init__(self):\n        self.root=Node(0)\n    def insert(self,s:str):\n        insert(self.root,s)\n\nn,l=map(int,input().split())\nS=[input().strip() for _ in range(n)]\ntrie=Trie()\nfor s in S:\n    trie.insert(s)\nData=[]\nq=deque([trie.root])\n\ndef dfs(node):\n    if node.right is None and node.left is None:\n        return\n    if node.right is None or node.left is None:\n        Data.append(l-node.depth)\n    if node.right:\n        q.append(node.right)\n    if node.left:\n        q.append(node.left)\n\nwhile q:\n    dfs(q.popleft())\nxor=0\n\ndef Grundy(n):\n    ret=1\n    while n%2==0:\n        n//=2\n        ret*=2\n    return ret\n\nfor i in Data:\n    xor^=Grundy(i)\nprint('Alice' if xor else 'Bob')"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 19635