We’re preparing your current view and syncing the latest data.
Professor Mishka has a pool with n students. He tells n students to finish test in rounds of t minutes. Each round lasts exactly x minutes, but some students finish their tests earlier, causing others to wait for the next round. We count how many students will have to wait for the next round under the rounding rules.
The input consists of three integers n, x, and t separated by spaces.
Print the total number of students who have to wait.
1 ≤ n, x, t ≤ 10^9
Example 1
Input
5 2 6
Output
9
Explanation
With n=5, x=2, t=6, total waiting students are 9.