Problem 2

2012 ACU Programming Contest Series

Problem 2: Set

The Amalagated Consortium Union (ACU) recently discovered a useful (see Problem 3) set of non-negative integers generated by the following function.

g(i, j) = { nj + i mod j + 1, nj + i mod j + 2, ..., nj + j - 1 | n=0, 1, ..., i / j }

Create a program to generate, in ascending order, the set of integers in g(i, j).

Input

The first line will contain the number of data sets to process.

Each data set consists of a single line containing non-negative integer i and positive integer j separated by a single space. Both i and j will be less than 100.

    

Output

Each data set should produce a single line of integers separated by a single space.

Sample input: 
4
7 5
16 5
99 10
0 8
     Sample output: 
3 4 8 9
2 3 4 7 8 9 12 13 14 17 18 19

1 2 3 4 5 6 7