#K46582. Taco Sequence Generator

    ID: 28008 Type: Default 1000ms 256MiB

Taco Sequence Generator

Taco Sequence Generator

In this problem, you are given an integer t representing the number of test cases. For each test case, you will receive three integers: A, B, and M.

Your task is to generate a sequence of M numbers for each test case where the i-th term (using 0-indexing) is defined by the formula \(a_i = A + i \times B\). The resulting sequence must be printed as a space-separated list of integers. When printing the results for multiple test cases, separate each sequence by a blank line (i.e. two newline characters).

For example, if one of the test cases is 1 2 5, then the sequence is computed as:

(1,\ 3,\ 5,\ 7,\ 9)

and should be output as 1 3 5 7 9.

inputFormat

The input is read from stdin and has the following format:

  • The first line contains an integer t, the number of test cases.
  • Each of the following t lines contains three space-separated integers: A, B, and M.

outputFormat

For each test case, output the corresponding sequence as a space-separated list of numbers. Separate the outputs of consecutive test cases with a blank line (i.e., two newline characters). The output should be written to stdout.

## sample
2
1 2 5
3 4 3
1 3 5 7 9

3 7 11

</p>