该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Statement

Takahashi likes full moons.

Let today be day $1$. The first day on or after today on which he can see a full moon is day $M$. After that, he can see a full moon every $P$ days, that is, on day $M+P$, day $M+2P$, and so on.

Find the number of days between day $1$ and day $N$, inclusive, on which he can see a full moon.

Constraints

• $1 \le N \le 2 \times 10^5$
• $1 \le M \le P \le 2 \times 10^5$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

NMP

Output

Print the answer as an integer.

Sample1

13 3 5

3

He can see a full moon on day $3$, $8$, $13$, $18$, and so on.

From day $1$ to $13$, he can see a full moon on three days: day $3$, $8$, and $13$.

Sample2

5 6 6

0

There may be no days he can see a full moon.

Sample3

200000 314 318

628