Count how many integers in the inclusive range [1, n] are divisible by a or by b (or both). Use inclusion-exclusion: floor(n/a) + floor(n/b) - floor(n/lcm(a,b)).
Input format
One line: three integers n, a, b.
Output format
One line: the count of integers in [1, n] divisible by a or b.
Constraints
- 1 <= n <= 1000000000000
- 1 <= a, b <= 1000000