The Summation Reduction Problem

You are given a list of integers. You can perform the following operation any number of times: choose any two integers from the list, remove them, and insert their sum back into the list. Notice that the sum of the list remains invariant regardless of the order in which you perform the operations. Therefore, the value of the final remaining element after repeatedly performing this operation is simply the sum of all the integers in the list.

Your task is to compute this sum for each of the given test cases.

Note: Even though the problem statement describes an operation on the list, the final answer is uniquely determined by the sum of all the integers.

inputFormat

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

T
N₁
a₁ a₂ ... aₙ₁
N₂
b₁ b₂ ... bₙ₂
...
Nₜ
z₁ z₂ ... zₙₜ

Where T represents the number of test cases. For each test case, the first line contains an integer N which is the number of elements in the list, followed by a line containing N space-separated integers.

outputFormat

For each test case, output the sum of the integers on a new line. The output should be written to standard output (stdout).

## sample

1
3
1 2 3

6

</p>