Pay for the purchase without change#8534
In a certain country, coins are available in two denominations: and units. How many different ways can you pay for a purchase costing units using these coins, so that no change is required? Two ways are considered different if they differ in the number of coins of at least one denomination.
The input consists of a single line containing three positive integers: , , and , where N, M1, M2 < 10^6 and M1 \neq M2.
Output a single number — the answer to the problem.
Example 1