Maximum Sum After Operation

You are given T test cases. For each test case, you are provided with an integer n and an array of n integers. Your task is to compute the maximum sum achievable after performing a special operation on the array.

In this problem, the special operation is defined as summing all elements of the array, i.e., $$\sum_{i=1}^{n}a_i$$. Although the operation is trivial, you must implement the solution to work for multiple test cases.

inputFormat

The first line contains a single integer T, the number of test cases. For each test case, the first line contains an integer n (the number of elements in the array), and the second line contains n space-separated integers.

outputFormat

For each test case, output a single integer representing the maximum sum on a separate line.## sample

3
5
1 2 3 4 5
3
5 5 5
4
1 2 2 1

15
15
6