Question
Can Rohan Steal All the Jewelry?
In a quiet village, a young man named Rohan dreamed of becoming rich overnight. He and his N friends (including himself) came up with a daring plan to rob a house full of precious jewelry under the cover of darkness. The house contained a total of X kg of jewelry, and each of Rohan's friends, including him, could carry up to Y kg of jewelry.
Now, Rohan is wondering if their combined strength will be enough to steal all the jewelry in one go. Can you help Rohan figure out whether he and his friends can successfully carry all the jewelry out of the house?
Now, Rohan is wondering if their combined strength will be enough to steal all the jewelry in one go. Can you help Rohan figure out whether he and his friends can successfully carry all the jewelry out of the house?
Input
The only line contains N, X, and Y denoting the number of friends(including Rohan), jewellery weight, and capacity of every friend respectively.
Constraints
1 ≤ N, X, Y ≤ 1000
Constraints
1 ≤ N, X, Y ≤ 1000
Output
Print(without quotes) "Yes" if Rohan and his friends will be able to steal all jewellery from the house otherwise print(without quotes) "No".
Example
Sample Input
2 10 3
Sample Output
No
Explanation
2 people carry 3-3 Kg each so in total they can carry 6Kg which is less than 10Kg. Hence they won't be ale to steal all jewellery from the house.
Hence "No"(without quotes) will be printed.
2 10 3
Sample Output
No
Explanation
2 people carry 3-3 Kg each so in total they can carry 6Kg which is less than 10Kg. Hence they won't be ale to steal all jewellery from the house.
Hence "No"(without quotes) will be printed.