{"raw_statement":[{"iden":"problem statement","content":"Takahashi likes full moons.\nLet 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.\nFind the number of days between day $1$ and day $N$, inclusive, on which he can see a full moon."},{"iden":"constraints","content":"*   $1\\leq N\\leq 2\\times 10^5$\n*   $1\\leq M \\leq P \\leq 2\\times 10^5$\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $M$ $P$"},{"iden":"sample input 1","content":"13 3 5"},{"iden":"sample output 1","content":"3\n\nHe can see a full moon on day $3$, $8$, $13$, $18$, and so on.\nFrom day $1$ to $13$, he can see a full moon on three days: day $3$, $8$, and $13$."},{"iden":"sample input 2","content":"5 6 6"},{"iden":"sample output 2","content":"0\n\nThere may be no days he can see a full moon."},{"iden":"sample input 3","content":"200000 314 318"},{"iden":"sample output 3","content":"628"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}