Count Turns

Alice and Bob are playing the following game: There are $N$ stones in a pile, and a positive integer $K$. They take turns with Alice going first. In one turn, the player can take at least one and at most $K$ stones from the pile. The game ends when there are no more stones left.

Task

Alice wins, if the total number of turns until this point is divisible by $K$, Bob wins otherwise. Given $N$ and $K$, determine who has a winning strategy.

Input data

The first line of the input file contains a single integer $T$, the number of test cases. $T$ test cases follow. Each test case consists of a line containing integers $N$, $K$, the number of stones in the pile and the maximum number of stones that can be taken in one turn, respectively.

Output data

The output file must contain $T$ lines corresponding to the test cases, each consisting of the string Alice, if Alice has a winning strategy, or Bob otherwise.

Constraints and clarifications

• $1 \leq T \leq 100$;
• $1 \leq K \leq N \leq 10^9$;
• Let $\sum N$ be the sum of the $N$-s over the test cases.
• $\sum N \le 10^9$

Example 1

stdin

3
3 2
4 3
47 7

stdout

Alice
Bob
Bob

Explanation

In the first example Alice can take two stones, forcing Bob to take the last one. The total number of turns is two, which is divisible by $K=2$, so Alice wins.

In the second example Bob can always force the game to end in two turns, winning the game.