Alice's Unbeatable Painting Game

In this problem, you are given a painting game where Alice and Bob take turns painting cells on a grid. The grid consists of $M \times N$ cells. Since the total number of cells is finite, i.e., $M \times N$, Alice, who always starts the game, can always secure the win by ensuring she paints the last cell. For each test case, regardless of the grid dimensions or the extra parameter $K$, output the winner of the game. (Note: Although $K$ is part of the input, it does not affect the outcome in this simplified version.)

inputFormat

The first line contains an integer $T$, the number of test cases. Each of the following $T$ lines contains three integers: $M$, $N$, and $K$, separated by spaces.

outputFormat

For each test case, output a single line containing the name of the winner, which will always be "Alice".## sample

3
2 2 3
2 3 2
1 1 1

Alice
Alice
Alice