A group of IIITG 1st year students goes to V.I.P chowk to drink mango shake!

Having entered the V.I.P cafe, the T friends found K different kinds of mango shake on the menu, that’s why they ordered K cans — one can(mango shake can) of each kind.The volume of mango shake in each can equals W.

All friends agreed to pour the entire shake evenly among T cups so that each got a cup.They give a challenge to Rakesh (one of their friend) to distribute the shake so that the shake from each can was in no more than two different cups. Help Rakesh write a program that will help to distribute the mango shake among the cups and drink it as quickly as possible!

Note: Please consider the accuracy upto 6 decimal places during computation.

Input

The input data file contains three integers K, W and T , where K stands for the number of ordered cans, W stands for the volume of each of them and T stands for the number of friends in the company.

Constraints

1 <= K <= 50

100<= W <= 1000

2 <= T <= 50

Output

Print ”YES” if it is possible to pour the mango shake so that the mango shake from each can was in no more than two different cups. If there’s no solution, print ”NO”.