Your friends Alice and Bob practice fortune telling.
Fortune telling is performed as follows. There is a well-known array in the increasing order of . The possible operations are:of non-negative integers indexed from to . The tellee starts with some non-negative number and performs one of the two operations for each ,
- replace their current number with
- replace their current number bitwise XOR operation) with (hereinafter denotes the
Notice that the chosen operation may be different for differentand for different tellees.
One time, Alice decided to start withand Bob started with . Each of them performed fortune telling and got a particular number in the end. Notice that the friends chose operations independently of each other, that is, they could apply different operations for the same .
You learnt that either Alice or Bob ended up with number exactly one of your friends could have actually gotten that number.in the end, but you don’t know whose of the two it was. Given the numbers Alice and Bob started with and , find out who (Alice or Bob) could get the number after performing the operations. It is guaranteed that on the jury tests,
You cannot make hacks in this problem.
On the first line of the input, you are given one number( ) — the number of test cases. The following lines contain test cases.
The first line of each test case contains three numbers, , ( , , ) — the length of array , Alice’s initial number (Bob’s initial number is therefore ), and the number that one of the two friends got in the end.
The second line of each test case containsnumbers — the array ( ).
It is guaranteed that the sum ofover all test cases does not exceed .
For each test case, print the name of the friend who could get the number: “Alice” or “Bob”.
4 1 7 9 2 2 0 2 1 3 4 0 1 1 2 3 4 2 1000000000 3000000000 1000000000 1000000000
Alice Alice Bob Alice
In the first test case, Alice could getusing the following operations: .
In the second test case, Alice could getusing this operations: .
In the third test case, Bob started withand could get this way: .