Rabbit Hanako and Fox Jiro are great friends going to JAG primary school. Today they decided to play the following game during the lunch break.</p>

This game is played by two players with (N) heaps of some number of stones. The players alternatively take their turn to play the game. Jiro is a kind gentleman, so he yielded the first turn to Hanako. In each turn, the player must take some stones, satisfying the following conditions:

• If the player is Hanako, she must take between (1) to (A) stones, inclusive, from a heap.

• If the player is Jiro, he must take between (1) to (B) stones, inclusive, from a heap.

The winner is the player who takes the last stone. Jiro thinks it is rude to go easy on her because he is a perfect gentleman. Therefore, he does him best. Of course, Hanako also does so.

Jiro is worried that he may lose the game. Being a cadet teacher working at JAG primary school as well as a professional competitive programmer, you should help him by programming. Your task is to write a program calculating the winner, assuming that they both play optimally.

입력 형식

The first line contains three integers (N), (A), and (B). (N) ((1 \leq N \leq 10^5)) is the number of heaps. (A) and (B) ((1 \leq A, B \leq 10^9)) are the maximum numbers of stones that Hanako and Jiro can take in a turn, respectively. Then (N) lines follow, each of which contains a single integer (S_i) ((1 \leq S_i \leq 10^9)), representing the number of stones in the (i)-th heap at the beginning of the game.

출력 형식

Output a line with "Hanako" if Hanako wins the game or "Jiro" in the other case.

예제 입력 1

3 5 4
3
6
12

예제 출력 1

Hanako

예제 입력 2

4 7 8
8
3
14
5

예제 출력 2

Jiro