Karim goes to a shop to buy his everyday groceries. Today Karim has come to buy items worth taka.
The Shopkeeper has an unlimited number of and 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 and taka coins. But the shopkeeper doesn’t care what coins Karim likes. He will stick to his way of making change.
So, Karim pays taka which is more than in hope of getting coins that he likes in change. If he gets or coins in the change he will walk home happy, sad otherwise.
Given and , you have to determine if Karim walks home happy or sad.
The first line will contain two space integers and , The amount Karim wants to buy and the amount Karim pays.
You have to output a string “Happy”, if Karim walks home happy, “Sad” otherwise, without the qoutations.
Explanation: In this case the shopkeeper will have to return 100 - 79 = 21 taka.
one 13 taka coin.
So, the coin values in the change are 13, 7 and 1.
Explanation: In this case the shopkeeper will have to return 26 - 23 = 3 taka.
one 2 taka coin.
So, the coin values in the change are 2 and 1.