class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_terminal = False

def insert_into_trie(root, binary_string):
    current_node = root
    for char in binary_string:
        if char not in current_node.children:
            current_node.children[char] = TrieNode()
        current_node = current_node.children[char]
    current_node.is_terminal = True

def count_free_positions(root, current_depth, L):
    if current_depth > L:
        return 0
    if root.is_terminal:
        # このノードが終端なら、その子は考慮しない
        return 0
    count = 1  # このノード自体が新しい文字列の候補
    for child in root.children.values():
        count += count_free_positions(child, current_depth + 1, L)
    return count

def solve(N, L, strings):
    root = TrieNode()
    for s in strings:
        insert_into_trie(root, s)
    
    free_positions = count_free_positions(root, 0, L)
    
    if free_positions % 2 == 1:
        return "Alice"
    else:
        return "Bob"

# Example usage
N = int(input())
L = int(input())
strings = [input().strip() for _ in range(N)]
print(solve(N, L, strings))