write a go solution for Description:
You are given an array x_2,x_3,...,x_n. Your task is to find any array a_1,...,a_n, where:

- 1<=a_i<=10^9 for all 1<=i<=n.
- x_i=a_ibmoda_i-1 for all 2<=i<=n.

Here cbmodd denotes the remainder of the division of the integer c by the integer d. For example 5bmod2=1, 72bmod3=0, 143bmod14=3.

Note that if there is more than one a which satisfies the statement, you are allowed to find any.

Input Format:
The first line contains a single integer t (1<=t<=10^4) — the number of test cases.

The first line of each test case contains a single integer n (2<=n<=500) — the number of elements in a.

The second line of each test case contains n-1 integers x_2,...,x_n (1<=x_i<=500) — the elements of x.

It is guaranteed that the sum of values n over all test cases does not exceed 2*10^5.

Output Format:
For each test case output any a_1,...,a_n (1<=a_i<=10^9) which satisfies the statement.

Note:
In the first test case a=[3,5,4,9] satisfies the conditions, because:

- a_2bmoda_1=5bmod3=2=x_2;
- a_3bmoda_2=4bmod5=4=x_3;
- a_4bmoda_3=9bmod4=1=x_4;. Output only the code with no comments, explanation, or additional text.