Maximum Sum Array Selection

You are given T arrays of integers. Your task is to select the array whose elements have the maximum sum. In case of a tie (i.e. more than one array has the same maximum sum), select the first one among them.

The sum of an array with elements \(a_1, a_2, \ldots, a_n\) is defined as \(S = \sum_{i=1}^{n}a_i\).

Please read the input from standard input (stdin) and output the required array to standard output (stdout) as a space-separated string of integers.

inputFormat

The first line of input contains an integer T, the number of arrays. This is followed by T lines, each representing an array of space-separated integers.

outputFormat

Output the array (as space separated integers) which has the maximum sum of its elements. If there are multiple arrays with the same maximum sum, output the first one.

## sample

1
1 2 3

1 2 3

</p>