CourseGrading

Description background

"I want jinkela. Africa's agriculture is underdeveloped, so we must have jinkela!"

"I want jinkela. Japan is too short of resources. We must have jinkela!"

"Jinkela!" "Jinkela!"

"No fighting! No fighting! What are the benefits of jinkela? Give it to anyone who is right!"

"Fertilizer mixed with jinkela, no loss, no evaporation, zero waste."

"The fertilizer mixed with jinkela can absorb nitrogen, phosphorus and potassium under two meters!"

"The prices of fertilizers all over the world have risen. A bag of fertilizer mixed with jinkela can top two bags!"

"With jinkela, the yield of wheat per mu is 1800. Japan will no longer import grain from the United States! Hahahahahaha!"

"Little devil, it's not stupid! Jinkela gave it to him, which is very harmful to American agriculture. Never give it to him!"

"Africa's agriculture is underdeveloped, and we all need to support it! Jinkela! Japan is gone!"

"Cunning! Cunning! How to grow crops without jinkela! Jinkela! Jinkela!"

hibiki and nolv fought again because of Jinkela. Their teammates couldn't stand it anymore and asked them to solve the problem by board game.The game is played on the M*N (1 < = M < = 1000000; 1 < = N < = 1000000) board. The grid coordinates of the bottom left corner of the chessboard are (0, 0), and the grid coordinates of the top right corner are (M,N).

The rules of the game are as follows:

1.The chess pieces start at (0,0) position, and the two people move the chess pieces in turn.

2.There are three options for each move:

You can move any grid directly above.
You can move any grid to the right.
You can move any grid up and right along the diagonal.

3.The first player who can't move loses the game

hibiki and nolv are certainly extremely smart. But because nolv can't beat hibiki , so hibiki is the first and nolv is the second. Who can get the Jinkela?

Input

Multi group input

Each test contains multiple test cases. The first line contains the number of test cases T(1≤T≤100000). Description of the test cases follows.

Two integers per line M N (1<=M,N<=1000000)

The meaning is as described in the topic

Output

For each row of data, output a row of answers. If nolv wins, output Nolv yyds, and if hibiki wins, output Hibiki yyds.

Sample Input

Sample Output

Hibiki yyds
Hibiki yyds
Hibiki yyds

难度等级：	0
总通过次数：	4
总提交次数：	125

3393. Let the Renaissance Again Again