{"raw_statement":[{"iden":"statement","content":"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.\n\nThe game is described by the following rules :\n\nAyoub picks a random integer $n$ $(1 <= n <= 10^9)$ , and Kilani picks a random integer $k$ $(1 <= k <= n)$, then they will start playing. In each turn a player can choose any number $x$ $(1 <= x <= m a x (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.\n\nIf Kilani starts, and each player played optimally, who would be the winner?\n\nFirst line of input contains integer $T$ $(1 <= T <= 10^4)$ the number of test cases.\n\nEach one of next $T$ lines contains two integers $n$ and $k$, $(1 <= k <= n <= 10^9)$.\n\nprint \"Kilani\" if he wins, and print \"Ayoub\" otherwise. (the output is case sensitive) \n\n"},{"iden":"input","content":"First line of input contains integer $T$ $(1 <= T <= 10^4)$ the number of test cases.Each one of next $T$ lines contains two integers $n$ and $k$, $(1 <= k <= n <= 10^9)$."},{"iden":"output","content":"print \"Kilani\" if he wins, and print \"Ayoub\" otherwise. (the output is case sensitive) "}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{P} $ be a given prime number, where $ 2 \\leq n \\leq 10^7 $.  \nLet $ \\mathbb{P} $ denote the set of prime numbers.\n\n**Objective**  \nFind $ a, b \\in \\mathbb{P} $ such that $ a + b = n $.  \nIf no such pair exists, output $-1$.","simple_statement":"Given a prime number n, find two prime numbers a and b such that a + b = n. If no such pair exists, print -1. Otherwise, print a and b.","has_page_source":false}