E. Easter Eggs
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output

Easter is coming! To celebrate, Eason and Emil will play a game against each other. Initially, Eason and Emil has $$$A$$$ and $$$B$$$ chocolate Easter eggs, respectively. They will alternately do the operation below.

  • Eat one of the Easter Eggs he has.

The person who first becomes unable to do the operation loses. Which person will win?

Input

The first line contains an integer $$$t\,(1 \leq t \leq 10^5)$$$, the number of input cases. Then $$$t$$$ lines follow. For each line, there are three integers $$$A$$$, $$$B$$$ and $$$C$$$ ($$$0 \le A, B \le 100, C \in \{0,1\} $$$). $$$A$$$ and $$$B$$$ are the numbers of chocalate Easter eggs that Eason and Emil has, respectively. Eason goes first if $$$C = 0$$$, and Emil goes first if $$$C = 1$$$.

Output

For each case, if Eason will win, print Eason; if Emil will win, print Emil.

Example
Input
3
2 1 0
2 2 0
2 2 1
Output
Eason
Emil
Eason
Note

In the first example, Eason and Emil start with $$$2$$$ and $$$1$$$ candy(ies), respectively. The game will proceed as follows:

  • Eason eats his Easter egg.
  • Emil eats his Easter egg.
  • Eason eats his Easter egg.
  • Emil has no more Easter eggs, so Eason wins.