Problem Description
Damian loves his multiplication tables (of all shapes and sizes).
That being said, given their structure, they always start from the same small values and never quite seem to reach the truly large numbers.
Hence, he would like to have a way to easily find all the multiples of a number N within a certain range [S, E].
Can you help him?
Input
The first line contains one integer, N.
The second line contains two integers, S and E.
Output
Print out the multiples of N in ascending order, on separate lines.
There is guaranteed to be at least one multiple of N within the range.
Limits
Subtask 1 (100%): 1 ≤ N ≤ 1000. 1 ≤ S ≤ E ≤ 100 000
Subtask 2 (0%): Sample Testcases
Sample Testcase 1
Input
3
10 20
Output
12
15
18