题号：NC237147
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Alice and Bob plan to play the following game:
At the beginning of the game,
straight lines have been drawn on the paper, the 
th straight line can be represented as 
(It's guaranteed that all straight lines are different).
Then, Alice and Bob draw a straight line on the paper in turn (It's also required that the new line cannot coincide with any existing one).
rounds will be carried out, thus there will be 
different lines on the paper eventually.
At the beginning of the game,
Then, Alice and Bob draw a straight line on the paper in turn (It's also required that the new line cannot coincide with any existing one).
Consider the th line and the 
th line (
), if they have intersection, we call )
a good pair.
If the number of good pairs is odd Bob wins, otherwise Alice wins.
As you know, Alice and Bob are extremely smart, so who will win the game?
If the number of good pairs is odd Bob wins, otherwise Alice wins.
As you know, Alice and Bob are extremely smart, so who will win the game?
输入描述:
The input consists of multiple test cases. The first line contains a single integer- the number of test cases. Description of the test cases follows.
The first line of each test case contains two integers.
Each of the next- the
It's guaranteed that allpair are different.
输出描述:
For each test case, output "Alice" if Alice will be the winner, otherwise "Bob" (without quotation marks).