Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

GoG

By curly_braces · Limits 1s, 512 MB

Alice and Bob are playing GoG. GoG is a two-player board game. It consists of a grid with nn rows and mm columns. Players take alternate moves. In each move, a player can move in four directions(Up, Down, Left, and Right). If a player goes out of the grid or goes to a cell that has already been visited by any player (Alice or Bob), then the player dies. The last person alive wins.

Alice starts at the top-left cell and Bob starts at the bottom-right cell. Can you determine the winner, considering both players play optimally and Alice goes first?

Input

The first line of the input will contain a single integer T(1T100)T (1 \leq T \leq 100), the number of test cases.

The next TT lines each will contain the two integers nn and m(1n,m105;2n×m105)m (1 \leq n, m \leq 10^5; 2 \leq n \times m \leq 10^5), the dimensions of the grid for that testcase.

Output

For each testcase, print the name of the winner in a new line.

Sample

InputOutput
2
1 3
2 2
Alice
Bob

    Discussion

    Statistics


    97% Solution Ratio

    Siddik_53rdEarliest, 1w ago

    Zobayer_AbedinFastest, 0.0s

    Siddik_53rdLightest, 131 kB

    FrdhsnShortest, 200B

    Submit

    Login to submit

    Editorial

    We claim that if there are even number of cells then Bob wins, and if there are odd number of cells ...

    Toph uses cookies. By continuing you agree to our Cookie Policy.