Problem Description

Alice and Bob are playing a stone game in a board of $n\times m$ cells.

In the begining, the stone is in the upperleft cell. And in each turn, they can move the stone one cell to the right or one cell down, or diagonally $k$ cells down to the right, which means if you are at $(x,y)$, then you could move into $(x+1,y)$, $(x,y+1)$ or $(x+k,y+k)$ at the next step. The player who can not move loses. They play in turns and Alice moves first.

Now given $n$, $m$ and $k$, could you tell me who is the winner?

Input

First line contains an integer $T(1\leq T\leq 10)$, denoting the number of test cases.

In each test case, the first line is two integers $Q$ and $k$.
In the following $Q$ lines, each line contains $n$ and $m$.$(1\leq Q\leq 1000,1\leq k,n,m\leq 10^9)$

Output

For each test case, output $Q$ lines.
If Alice is the winner, output ``Alice''. Otherwise ``Bob''.

2
2 1
4 5
3 4
2 3
4 5
5 6

Alice
Alice
Alice
Bob