Go Back
##### Cibin Challenges Harsh (100)
Description

One fine day, Cibin was challenged by one of his peers to play this virtual game called “Skull Crusher”. Harsh is a gaming addict. He spends most of his time playing games. Cibin and Harsh are close friends. So, Cibin wanted to challenge Harsh to play the game. But since Harsh is a professional gamer, Cibin decided to give him a tougher task.

Cibin will give him the minimum required points X. He has to get a minimum of X points in order to win the challenge.
In order to win this game, there will be exactly 5 trials, namely t1, t2, t3, t4, t5. If the sum of the points of these trials is greater than or equal to X, Harsh will win the challenge. Or else, he loses the Challenge.

But since Harsh is passionate towards gaming, he wants to know the minimum points he will need to score in order to pass the given points X.

The minimum extra points that has to be scored in order to get the overall score equal to X are M. M are the extra points he needs to increase in the highest score of that attempt.

Input

The first line of input contains an integer T denoting the number of test cases. Each test case consists of two lines.
The first line of each test case consists of a single integer X.
The second line of each test case consists of five space-separated integers t1 t2 t3 t4 t5 denoting the score of each trial.

Output

For each test case, output the answer in one single line.
If the total score is strictly less than X, output M, which is the required additional score in the total score in order to win the challenge.
Or else output “Harsh Wins” (without quotation mark).

Constraints

1 <= T <= 100
1 <= X <= 10^5
-10^5 <= t1, t2, t3, t4, t5 <= 10^5

Example

Input:
2
35
-1 -2 4 6 7
2
2 5 7 1 7

Output:
21
Harsh Wins

Explanation

Test case 1 :
Total score is 14 < 35. So, in order to get minimum score(35), we need to add 21.