Module: Nested conditional statement. Difficult conditions


Problem

8 /14


Donuts

Problem

Dedicated to donut lovers! 

Donuts — These are dough products fried in oil. Prepare  donuts with or without filling. You can put p donuts into the oil pot at the same time. Each donut needs to be fried on both sides for m minutes continuously. 
Write a program that will determine the minimum number of minutes in which n donuts will be ready.

Input 
The program receives three natural numbers as input: pm and n, one per line.

Imprint
Output the answer to the problem.

 

Examples
# Input Output
1 1
5
1
10
2 2
3
7
21