Lomonosov of our days
Vasya Lomonosov woke up and realized he was running late for his entrance exam, which starts in exactly hours. He had planned to walk to the university from his village, just like his famous ancestor, but now he was worried about being late. So, he decided to ask the local farm driver for help. Vasya didn’t have much money and still wanted to stick to tradition, so he aimed to ride as little as possible. He made a deal with the driver: the driver would take him part of the way, and then Vasya would walk the rest.
When riding in the car, Vasya's speed is km/h, and the fare is rubles per kilometer (rounded to the nearest whole number using standard rules). If he walks, his speed is km/h, and of course, walking is free.
The question is, can Vasya make it on time? If so, what’s the minimum amount of money he’ll need to pay the driver (if he even needs to use the car at all)? Time to crunch some numbers...
Input
The first line contains two numbers separated by a space: and , where , .
is the distance to the university from the village (in kilometers), and is the time left (in hours).
The second line contains three numbers: , , and , where , , .
All values are integers.
Output
If Vasya can make it on time, print the minimum amount of money he needs to spend (in rubles). If it’s not possible, print "NO".