Problem Description
Have you ever heard of the FizzBuzz test? Your task is to implement a slightly harder version of it!
You are given four integers, S, E, A and B. Print all integers from S to E inclusive, one on each line, and replace the integer with "Fizz" if it is divisible by A, "Buzz" if it is divisible by B, and "FizzBuzz" if it is divisble by both!
Sounds easy?
Limits
For all tests: A, B > 0, E - S ≤ 105, A and B will fit into a 32-bit signed integer.
Subtask 1 (30%): S = 1.
Subtask 2 (70%): 1 ≤ S ≤ E ≤ 1018.
Subtask 3 (0%): Sample Testcases.
Input
The only line of input will contain four integers, S, E, A and B.
Output
Your output should contain E - S + 1 lines, with the format specified above.
Sample Testcase 1
Input
1 8 2 3
Output
1
Fizz
Buzz
Fizz
5
FizzBuzz
7
Fizz
Sample Testcase 2
Input
1673329 1673339 4 10
Output
1673329
Buzz
1673331
Fizz
1673333
1673334
1673335
Fizz
1673337
1673338
1673339