Basically, this is how it works: you print the integers from $1$ to $N$, replacing any of them divisible by $X$ with Fizz or, if they are divisible by $Y$, with Buzz. If the number is divisible by both $X$ and $Y$, you print FizzBuzz instead.
Check the samples for further clarification.
Input file will contain a single test case. Each test case will contain three integers on a single line, $X$, $Y$ and $N$ ($1 \leq X < Y \leq N \leq 100$).
Print integers from $1$ to $N$ in order, each on its own line, replacing the ones divisible by $X$ with Fizz, the ones divisible by $Y$ with Buzz and ones divisible by both $X$ and $Y$ with FizzBuzz.
Sample Input 1 | Sample Output 1 |
---|---|
2 3 7 |
1 Fizz Buzz Fizz 5 FizzBuzz 7 |
Sample Input 2 | Sample Output 2 |
---|---|
2 4 7 |
1 Fizz 3 FizzBuzz 5 Fizz 7 |
Sample Input 3 | Sample Output 3 |
---|---|
3 5 7 |
1 2 Fizz 4 Buzz Fizz 7 |