# Karim's Favorite Coin

Unlock The Algorithm, Fal...
Limits 1s, 512 MB

Karim goes to a shop to buy his everyday groceries. Today Karim has come to buy items worth $\bf{N}$ taka.

The Shopkeeper has an unlimited number of $\bf{1, 2, 7, 9, 13}$ and $\bf{25}$ taka coins. But still he wants to keep the number of coins in the change minimum. So, he always returns the change taking the largest value coins first.

Karim likes the $\bf{7}$ and $\bf{9}$ taka coins. But the shopkeeper doesn’t care what coins Karim likes. He will stick to his way of making change.

So, Karim pays $\bf{K}$ taka which is more than $\bf{N}$ in hope of getting coins that he likes in change. If he gets $\bf{7}$ or $\bf{9}$ coins in the change he will walk home happy, sad otherwise.

Given $\bf{N}$ and $\bf{K}$, you have to determine if Karim walks home happy or sad.

## Input

The first line will contain two space integers $\bf{N}$ and $\bf{K}$, The amount Karim wants to buy and the amount Karim pays.

$\bf{1 \le N < K \le 10^5}$

## Output

You have to output a string “Happy”, if Karim walks home happy, “Sad” otherwise, without the qoutations.

## Samples

InputOutput
79 100

Happy


Explanation: In this case the shopkeeper will have to return 100 - 79 = 21 taka.
His strategy will be like this:

one 13 taka coin.
one 7 taka coin.
one 1 taka coin.

So, the coin values in the change are 13, 7 and 1.
Karim’s favorite coin 7 is present which made him happy.

InputOutput
23 26

Sad


Explanation: In this case the shopkeeper will have to return 26 - 23 = 3 taka.
His strategy will be like this:

one 2 taka coin.
one 1 taka coin.

So, the coin values in the change are 2 and 1.
Neither 7 nor 9 taka coin is present in the change. It made Karim Sad.