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

blackshadows | 242 |

layman_brother | 234 |

xmyqsh | 220 |

Adarsh Trivedi | 205 |

hanuman001 | 200 |

blackshadows | 724 |

xmyqsh | 561 |

aman19 | 402 |

r0c2048 | 360 |

mb1973 | 335 |

akhayrutdinov | 5005 |

Ibrahim Nash | 4875 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3228 |

Login to report an issue on this page.