该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Statement

Alice and Bob are playing a game called ''Dare to Kill My Horse."

The rules of the game are that Alice and Bob ride horses to the arena. Alice has $a$ HP (life points) and Bob has $b$ HP.

They each have a horse. Alice's horse has $c$ HP, while Bob's horse has $d$ HP.

They take turns playing for $k$ rounds until one of them wins, starting with Alice. Specifically, for $k = 1, 2, \ldots$ (in that order), they perform the following actions:

• If $k$ is odd and Alice's horse is still alive:
  1. Alice can attack Bob and reduce $b$ by $1$. If $b\leq0$, Alice wins.
  2. Alice can attack Bob's horse and reduce $d$ by $1$. If $d\leq0$, Bob's horse dies.
• If $k$ is even and Bob's horse is still alive:
  1. Bob can attack Alice and reduce $a$ by $1$. If $a\leq0$, Bob wins.
  2. Bob can attack Alice's horse and reduce $c$ by $1$. If $c\leq0$, Alice's horse dies.

That is, if either player loses their knight, they lose their attacking power and are at the mercy of the other player. As one of the smartest people in the world, you want to predict who will win before the game begins, assuming both players play at their best and attack in the most optimal way.

It can be proven that the game will never end in a draw. That is, one player has a strategy that can end the game in a finite number of moves.

Input

This problem contains multiple test cases.

The first line contains the number of test cases, $t$ ( $1 \le t \le 10^4$). The test cases are described below.

The first and only line of each test case contains four integers, $a$, $b$, $c$, $d$ ( $1 \leq a, b, c, d \leq 10^9$) — representing the health of Alice, the health of Bob, the health of Alice's horse, and the health of Bob's horse, respectively.

Output

For each test case, if Bob wins, output Bob, otherwise output Alice.

Samples

5
1 2 3 4
100 999 1 1
10 20 10 30
12 14 13 11
998 244 353 107

Bob 
Alice
Bob
Alice
Alice

Notes

In the first test case, Alice's health is only $1$. Therefore, no matter what Alice does in the first round, Bob will attack Alice in the second round, resulting in Bob's victory.

In the second test case, Bob's horse has only $1$ health. Alice will attack Bob's horse in the first round. After that, Bob will be unable to attack again, resulting in Alice's victory.