Henry is having a biologay lesson. However, since he drank 2 L of sparkling water during recess, he needs to go to the washroom in the middle of the lesson. Using Dijkstra's Algorithm, Henry found that the distance between his classroom and the nearest washroom (regardless of gender) is $D$ m.

Henry knows that in $1$ second, he can run any distance of $s$ m where $s$ is any integer he chooses between $0$ and $K$ inclusive (i.e. including both $0$ and $K$). What is the minimum number of seconds it will take Henry to reach the washroom?

Input

The input contains two integers $D$ and $K$.

Output

Output the minimum number of seconds it will take Henry to reach the washroom.

Constraints

Subtask 1 (50%): $1 \le D, K \le 10^3$
Subtask 2 (50%): $1 \le D, K \le 10^{18}$