D. Football Cup
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

It's the final game in NCD's football cup between Bashar's team and Hamada's team. Everyone is excited for the final. However, not everything was going according to the plan.

Originally, each team had $$$N$$$ players in the field and $$$M$$$ substitutes. But for Bashar's team, Bashar was a little injured, Mahmoud had a broken hand, and Ahmad had had a heavy breakfast. On the other hand, Abdullah from Hamada's team was upset for getting a red card in a previous game, and Karam's hair was red.

But still, the match began. The match consists of $$$K$$$ parts, each lasts $$$30$$$ minutes. And the team who has more goals at the end of the match wins. If at the end both teams have the same goals, Iskandar takes the cup to his office.

At the first few minutes, Majd scored a wonderful goal. But then, after a heroic save, Ghaffar got injured, and Hamada's team scored three goals and was close to winning. Then Bashar got angry and started dribbling everyone. In the meantime, Hadi was drinking yerba mate.

Anyway, the details aren't important for Mr. Tarek, the Sports coach. He just wants to know the result of the match. You are given the number of goals each team scored, print "Bashar" if Bashar's team won, print "Hamada" if Hamada's team won, and print "Iskandar" if there was a draw. (Yes you read all the statement for nothing, I'm sorry).

Input

First line of the input will be $$$T$$$, the number of test cases.

Next $$$T$$$ lines contain two numbers $$$X, Y$$$ $$$( 0 \le X, Y \le 10^{5} )$$$ the number of goals Bashar's team scored, and number of goals Hamada's team scored.

Output

For each test case print one line "Bashar", "Hamada" or "Iskandar".

Example
Input
5
1 5
2 0
0 0
3 3
6 2
Output
Hamada
Bashar
Iskandar
Iskandar
Bashar