3073: Game

As you know, Alice and Bob may be late, but they will never be absent.

Here comes a new game. There are $n$ piles of stones, Alice and Bob take turns to remove stones. On each turn, a player must choose one pile and remove at least one stone, at most $k$ stones. The goal of the game is to take the last stone. In other words, the player who take the last one wins. To make the game more interesting, after every move, the number of stones in each pile can't be less than the previous pile except the first. Bob always takes the first move, I will give you an Ac as gift if you can tell me who can win this game.

It is guaranteed that the initial status is always legitimate.

The first line contains an integer number T, the number of test cases.

For each test case :

The first line contains two integers $n$, $k$($1 \leq n \leq 10000, 1 \leq k \leq 100$), the number of piles and the maximum number of stones each turn can remove.

The second line contains $n$ integers $A_{i}$($1 \leq A_{i} \leq 10^{6}$), the number of stones in $i^{th}$ pile.

For each test case print“Alice”(without quotes) if Alice wins, and“Bob”(without quotes) otherwise.

2
3 2
3 6 8
4 3
2 5 6 13

Bob
Alice