Alice and Bob are playing a game. There are two piles of lemons, one pile consisting of lemons and the other pile consisting of lemons . The two players perform the following operation alternately, starting from Alice:
- Take lemons from the pile with more lemons, and must be a positive multiple of the smaller pile.
- If any pile is empty, the current player cannot perform any operation and then (s)he is the loser, while the other player is the winner.
If both players play optimally, can you write a program to determine if Alice or Bob will win the game? Your program needs to determine the winner for rounds.
Input Specification
The first line contains one integer, (), the number of games.
Each of the next lines contains two space-separated integers and ().
Output Specification
For each query, if Alice wins, print Alice Win
; otherwise, print Bob Win
.
Sample Input
4
2 1
5 4
37 15
82 76
Sample Output
Alice Win
Bob Win
Alice Win
Bob Win
Explanation
For the st game, Alice can take lemons from the first pile, and Bob will lose the game.
For the nd game, Alice must take lemons from the first pile. The two piles will have lemons. Bob can take lemons from the nd pile and win the game.
Comments