Two player game:

Given two numbers x and m. Grid is built in the following fashion:

x x+1 x+2 … x+m-1

x+1 x+2 x+3 … x+m

```
...........
...........
```

x+m-1 x+m x+m+1 … x+2m-2

Each cell is a pile and the value in each cell is the number of stones in that pile. Alice and Bob are playing the game. In each turn, a player removes any non-zero number of stones from any one pile. Game ends when all the piles become empty. Last player to make a move wins. Both of them play optimally. Alice starts the game. You have to tell who the winner will be.

Constraints:

1 <= T <= 10^5

0 <= x,m <= 10^18