# The Foolish Hunter

Limits 1s, 512 MB

Abul the hunter goes to $X$ number of places to hunt animals every day. In every place, there are $Y$number of animals exactly. The weapon he uses to hunt animals can hunt atmost $Z$ number of animals. So, sometimes he might need to carry more than one weapon with him so that he can hunt all the animals. But the problem is he is bad at math. That's why he can't calculate properly the minimum number of weapons needed to be carried by him so that he can hunt all the animals from all the places. Abul is your friend. After seeing him struggling foolishly for days, you wanted to help him reduce his workload. Now, your task is to find minimum number of weapons Abul needs to carry so that he can hunt all the animals.

## Input

The single line of input contains three integers $X, Y, Z$ separated by space indicating the number of places, the number of animals a single place has, and the number of animals a weapon can hunt respectively.

$1 \leq X, Y, Z \leq 2000$

## Output

You have to output a single number $Count$ where $Count$ is the minimum number of weapons Abul needs to carry to hunt all the animals in all the places.

## Samples

InputOutput
5 3 3

5

InputOutput
11 4 6

8


Number of places, $X = 11$

Number of animals, $Y = 4$

Hence Total number of animals $X * Y = 11 * 4 = 44$

As a weapon can kill atmost $Z = 6$ numbers of animals, if we use $7$ weapons, then $42$ animals will be killed and $2$ will remain, we need another one weapon to kill these two animals. Hence, we need total $8$ weapons to kill them all.

Be careful about the newline(‘\n’) at the end.