Petya needs to wallpaper a wall measuring N meters high and M meters wide. For gluing, wallpaper is used, which is sold in rolls. Each roll is 1 meter wide and K meters long. Wallpaper is glued to the wall in vertical stripes (from top to bottom). At the same time, Petya wants to glue the wallpaper in such a way that there are no horizontal joints of different pieces (that is, one whole piece is glued from ceiling to floor). Pieces of the desired size can be cut from the roll (sometimes a piece of a smaller size may remain, which therefore cannot be glued, this piece goes to waste).
Given the numbers N, M and K, determine the smallest number of rolls Petya needs to buy to cover the entire wall.
Input
Natural numbers N, M and K are introduced (1 ≤ N ≤ 100, 1 ≤ M ≤ 100, N ≤K ≤100).
Imprint
Print one number - the number of rolls Petya should buy.
Examples
| # |
Input |
Output |
| 1 |
10
5
25 |
3 |
| 2 |
3
6
9 |
2 |