Knight Game

The rule of this game is given as follows.

• There is a knight and a chessboard with $H$ rows and $W$ columns. The square at the $i$-th row from the top and the $j$-th column from the left is called square $(i, j)$. Initially, the knight is placed on square $(x,y)$.
• Alice and Bob take turns, starting with Alice. On each turn, the player moves the knight to one of the unvisited squares according to the knight's movement rule.
• The knight can move from $(x\_1,y\_1)$ to $(x\_2, y\_2)$ if and only if $(x\_1 - x\_2)^2 + (y\_1 - y\_2)^2$ is $5$.
• The player who cannot move the knight loses.

Assuming both players play optimally, determine whether Alice or Bob wins. Answer for $T$ test cases.

An unvisited square is defined as follows.

• A square on the board that the knight has never visited since the start of the game.

$T$

$\text{case}\_1$

$\vdots$

$\text{case}\_T$

$\text{case}\_i$ is the $i$-th test case.

Each test case is given in the following format.

$H$ $W$ $x$ $y$

Output $T$ lines. On line $i$, print the winner of the $i$-th test case, Alice or Bob.

• All inputs are integers.
• $1 \le T \le 2 \times 10^5$
• $1 \le H, W \le 10^9$
• $1 \le x \le H$
• $1 \le y \le W$