Sakurako wants to play with her favorite toy, which is meters from her. In one step, she can go from to meters forward (if a toy is closer than meters, then she can step over it). Sakurako is in a hurry, so she asks you what the minimum number of steps required to reach the toy is.
The first line contains and (1\le m, k\le 10^{18}) — the distance of the toy from Sakurako and the maximum size of Sakurako's step.
Note that it is recommended to use 64-bit integers (for example, long long in C++).
Print a single number — the minimum number of steps Sakurako needs to make.
Example 1
Example 2
In the first example, Sakurako can take steps of and . She can also take steps of and .
In the second example, she needs to take step three times.
In this problem, there are conditional blocks. If your solution works correctly for certain constraints, it will receive a certain number of points. Note that testing is going test by test, but not by blocks.
( points): m\le 10^5;
( points): without additional constraints.