We use the integers a, b, and n to create the following series:
(a+2^0*b), (a+2^0*b+2^1*b).......(a+2^0*b+2^1*b......+2^n-1*b)

You are given q queries in the form of a, b, and n. For each query, print the series corresponding to the given a, b, and n values as a single line of n space-separated integers.

Input Format :-

The first line contains an integer, q, denoting the number of queries.
Each line i of the q subsequent lines contains three space-separated integers describing the respective ai, bi, and ni values for that query.

Constraints :-

• 0 <= q <= 500
• 0 <= a,b <= 50
• 1 <= n <= 15

Output Format :-

For each query, print the corresponding series on a new line. Each series must be printed in order as a single line of n space-separated integers.

2
0 2 10
5 3 5

2 6 14 30 62 126 254 510 1022 2046
8 14 26 50 98

Explanation :-

• S0 = 0 + 1*2 = 2
• S1 = 0 + 1*2 + 2*2 = 6
• S2 = 0 + 1*2 + 2*2 + 4*2 = 14

... and so on.
Once we hit n=10, we print the first ten terms as a single line of space-separated integers.

2. We use a = 5, b = 3, and n = 5 to produce some series S0, S1, ..., Sn-1:

• S0 = 5 +1.3= 8
• S1 = 5 + 1*3 + 2*3 = 14
• S2 = 5 + 1*3 + 2*3 + 4*3 = 26
• S3 = 5 + 1*3 +2*3 + 4*3 + 8*3 = 50
• S4 = 5 + 1*3 + 2*3 + 4*3 + 8*3 + 16*3 = 98
  

We then print each element of our series as a single line of space-separated values.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

// Java Loops II - Hacker Rank Solution Java
import java.util.*;
import java.io.*;

class Solution
{
    public static void main(String []argh)
    {
        Scanner in = new Scanner(System.in);
        int t=in.nextInt();
        for(int i=0;i<t;i++)
        {
            int a = in.nextInt();
            int b = in.nextInt();
            int n = in.nextInt();
            // Java Loops II - Hacker Rank Solution Java START
            for (int j = 0; j < n; j++) 
            {
                a += b * (int) Math.pow(2, j);
                System.out.print(a + " ");
            }
            System.out.println();
            // Java Loops II - Hacker Rank Solution Java END
        }
        in.close();
    }
}