Generalized FizzBuzz

면접 대비

시간 제한1초메모리 제한2048 MB

요약

정수 n, a, b가 주어질 때 1부터 n까지의 수 중 일반화된 FizzBuzz 규칙에 따라 Fizz, Buzz, FizzBuzz가 각각 몇 번 출력되는지 센다.

난이도: 쉬움10점 중 3점
유형: 수학, 정수론
정답자: 아직 제출이 없습니다

문제

FizzBuzz is a common coding interview problem. The problem is as follows:

Given a positive integer $n$ , for all integers $i$ from 1 to $n$ , inclusive:

If $i$ is divisible by both $3$ and $5$ , print "FizzBuzz".

Otherwise, if $i$ is divisible by $3$ , print "Fizz".

Otherwise, if $i$ is divisible by $5$ , print "Buzz".

Otherwise, print $i$ .

We are interested in a generalized version of FizzBuzz:

Given three positive integers $n$ , $a$ , and $b$ , for all integers $i$ from 1 to $n$ , inclusive:

If $i$ is divisible by both $a$ and $b$ , print "FizzBuzz".

Otherwise, if $i$ is divisible by $a$ , print "Fizz".

Otherwise, if $i$ is divisible by $b$ , print "Buzz".

Otherwise, print $i$ .

Given $n$ , $a$ and $b$ , how many times are "Fizz", "Buzz", and "FizzBuzz" printed for a correct implementation?

입력

The first and only line of input contains three positive integers $n$ , $a$ and $b$ $(1 \le n, a, b \le 10^6.)$

출력

Output three integers: the number of times "Fizz" is printed, the number of times "Buzz" is printed, and the number of times "FizzBuzz" is printed.

예제2

예제 1
입력
```
17 3 5
```
예상 출력
```
4 2 1
```
예제 2
입력
```
10 3 3
```
예상 출력
```
0 0 3
```