Ashish and Jeel are playing a game. They are given two piles of coins with $P$ and $Q$ coins respectively. They take alterate turns. During each turn, the player can choose one pile and split it into two non-zero parts and discard the other pile that is not choosen. The discarded pile cannot be used further in the game. A player loses if he cannot make a move. Both the players play the game optimally.
You are given $P$ and $Q$. Determine who wins the game if Ashish plays first.

Input format

• First line: An integer $T$ denoting the number of test cases
• Next $T$ lines: Two integers $P$ and $Q$

Output format

For each test case, print the winner of the game "Ashish" or "Jeel" (without quotes).
Answer for each test case should come in a new line.

Input Constraints

$1 \le T \le 10$

$1 \le P, Q \le 10^6$