Arithmetic Progression
Submissions: 1663   Accuracy:

17.04%

  Difficulty: Medium   Marks: 4

Construct the sequence arr[1], arr[2], ... by the following rules. For i=1 we put arr[1]=1. Now let i >= 2. Then arr[i] is the least positive integer such that the following two conditions hold
(i) arr[i] > arr[i - 1];
(ii) for all k, j < i we have arr[i] is not equal to n1 * arr[k] - n2 * arr[j].
Find the first n terms of this sequence.

Input:The first line contains a single integer T, the number of test cases. T test cases follow. The only line of each test case contains three integers n1, n2 and n.
Output:For each test case, output a single line containing the numbers arr[1], arr[2], ..., arr[n] generated by the rules given in the problem statement and numbers n1, n2. Separate any two consecutive numbers in a line by a single space.

Constraints:
Time limit=1 sec
1 <= T <= 50 
1 <= a, b <= 50 
1 <= n <= 1000
Example

Input:
3
2 1 10
1 1 5
4 2 4

Output:
1 2 4 5 10 11 13 14 28 29
1 2 3 4 5
1 3 4 5

** For More Input/Output Examples Use 'Expected Output' option **

Author: ruchirgarg05


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.