AT_past202212_a メダル

Takahashi has come to an amusement arcade with $ N $ yen (Japanese currency) in his pocket. In the arcade, he can pay $ X $ yen for $ Y $ tokens any number of times (possibly zero). Find the maximum total number of tokens that he can get.

The input is given from Standard Input in the following format: > $ N $ $ X $ $ Y $

Print the answer.

### Sample Explanation 1 Initially, Takahashi has $ 12 $ yen. - If he pays $ 5 $ yen for $ 3 $ tokens, he will have $ 7 $ yen and $ 3 $ tokens. - If he again pays $ 5 $ yen for $ 3 $ tokens, he will have $ 2 $ yen and $ 6 $ tokens. In this way, he can get $ 6 $ tokens in total, and there is no way to get more tokens. Thus, $ 6 $ should be printed. ### Sample Explanation 2 Since he has less than $ 5 $ yen, he cannot buy any tokens. ### Constraints - $ 1 \leq N \leq 10^{12} $ - $ 1 \leq X, Y \leq 10^{6} $ - $ N $ , $ X $ , and $ Y $ are integers.