Min-Max-Sum(c++)

_{(not allowed string and array)}

Problem Description

Gigi needs to find the smallest and largest values in a given list of numbers. Moreover, she needs to add them.

Input Format

The input begins with an integer N indicating the number of lists in the input. The succeeding lines are N lists. Each list begins with an integer T denoting how many integers n comprises the list. Assume the values in the list are unique.

Output Format

For each list, output the minimum, the maximum, and their sum. Separate the values by a single space. Output for each list must be in its own line.

Constraint

1 <= N <= 100

1 <= T <= 100

-100 <= n <= 100

Sample Input

2 4 5 3 7 8 5 38 79 53 41 36 

Sample Output

3 8 11 36 79 115