String Game

Alice and Bob play a game with strings of lowercase letters.

Before the game starts, an initial string and a target string are fixed. The initial string is at least as long as the target string. The current string starts out as the initial string, and the two players take turns. Bob goes first. On a turn the player to move deletes either the first letter or the last letter of the current string. The game stops as soon as the current string has the same length as the target string. If the string left at that moment is the target string, Alice wins. Otherwise Bob wins.

Both players play optimally. Determine who wins.

The first line contains $N$, the number of games to process. Each of the next $N$ lines holds one game. A line contains the initial string, one space, then the target string. Both strings consist of lowercase letters only. The whole input is shorter than $500000$ characters.

For each game print the winner on its own line. Print Alice if Alice wins and Bob if Bob wins.