Tweaked Array

You are given an array ‘ARR’ of size ‘N’ consisting of integers. The array needs to be tweaked a little bit.

Firstly, calculate ‘TotalSum’ = ‘ARR[0]’ + ‘ARR[1]’ + ... + ‘ARR[N - 1]’.

Now, for every ‘i’ (0 <= ‘i’ <= ‘N’ - 1), ‘ARR[i]’ is replaced with ‘ARR[i]’ = ‘TotalSum’ - ‘ARR[i]’.

Output the final array after tweaking it.

Example :

'N' = 3
'ARR' = {2, 4, 1, 1}

TotalSum = 2 + 4 + 1 + 1 = 8

Tweaked Array = {6, 4, 7, 7}.

Input Format :

The first line contains an integer ‘T’ which denotes the number of test cases to be run. Then the test cases follow.

The first line of each test case contains an integer ‘N’.

The second line contains ‘N’ space-separated integers denoting the elements of array ‘ARR’

Output format :

For each test case, print ‘N’ space-separated integers denoting the elements of the tweaked array.

Print the output of each test case in a new line.

Note :

You don’t need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 10
1 <= N <= 10^5
-10^5 <= ARR[i] <= 10^5
Sum of ‘N’ over all test cases is <= 10^5.

Time Limit: 1 sec