B. Road to Arabella
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Ayoub and Kilani felt board while they are going to ArabellaCPC in (Amman-Irbid) road, so Kilani invented a new game to play with Ayoub.

The game is described by the following rules :

Ayoub picks a random integer $$$n$$$ $$$(1 \leq n \leq 10^{9})$$$ , and Kilani picks a random integer $$$k$$$ $$$(1 \leq k \leq n)$$$, then they will start playing. In each turn a player can choose any number $$$x$$$ $$$(1 \leq x \leq max(1 , m-k) )$$$ (which $$$m$$$ is the current value of $$$n$$$) and subtract it from $$$n$$$. if $$$n$$$ equals zero then the player can't make a move. The player who can't make a move is considered to lose the game.

If Kilani starts, and each player played optimally, who would be the winner?

Input

First line of input contains integer $$$T$$$ $$$(1 \leq T \leq 10^4)$$$ the number of test cases.

Each one of next $$$T$$$ lines contains two integers $$$n$$$ and $$$k$$$, $$$(1 \leq k \leq n \leq 10^9)$$$.

Output

print "Kilani" if he wins, and print "Ayoub" otherwise. (the output is case sensitive)

Example
Input
2
2 1
4 1
Output
Ayoub
Kilani