题号：NC15414
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Recently Alice and Bob are playing a game about strings. Before starting the game, they should prepare n strings s
1, s
2, ..., s
n and a target string t. It's promised that each of these n strings is a substring of t.
When the game begins, they do the following things alternately while Alice starts first:
- Choose a string si from the n strings;
- Append one letter to the chosen string;
- The new string must also be a substring of t.
If the above things cannot be completed, the player loses the game. Suppose Alice and Bob both use optimal strategy, find who will win the game.
输入描述:
The input consists of multiple test cases.
Each test case begins with the non-empty target string t, whose length will not exceed 100000. The second line contains an integer n (1 ≤ n ≤ 100), the number of strings they prepared. Then n lines follow. The i-th line of the following n lines is the string si. The input guarantees that each of the n strings must be a non-empty substring of t.
The total length of all strings will not exceed 30000000.
输出描述:
For each test case, output the winner "Alice" or "Bob" (without quotes) in one line.