Gromozeka has
A slimes. Each time Gromozeka sneezes, the number of slimes increases by
K times. What is the minimum number of times Gromozeka needs to sneeze to get
B or more slimes?
Input
The input is three positive integers
A, B (1 <= A <= B <= 10
9),
K< /code> (2 <= K <= 109).
Imprint
Display the answer to the problem
Examples
| # |
Input |
Output |
| 1 |
1 4 2
|
2
|
| 2 |
31 415926 5
|
6
|