Unfair Game

Hanako and Jiro play a stone game with $N$ heaps of stones. They take turns, and Hanako moves first.

• On her turn, Hanako must take between $1$ and $A$ stones from one heap.
• On his turn, Jiro must take between $1$ and $B$ stones from one heap.

Neither player may take more stones than the chosen heap holds, and every turn must remove at least one stone. The player who takes the last stone wins.

Both players play optimally. Determine who wins.

The first line contains three integers $N$, $A$, and $B$, separated by spaces. $N$ is the number of heaps. $A$ and $B$ are the largest numbers of stones that Hanako and Jiro can take in one turn.

Each of the next $N$ lines contains one integer $S_i$, the number of stones in the $i$-th heap when the game starts.

• $1 \le N \le 10^5$
• $1 \le A, B \le 10^9$
• $1 \le S_i \le 10^9$

Print "Hanako" on one line if Hanako wins, or "Jiro" if Jiro wins.