n athletes compete in the hammer throw. Each of them made m throws. (n<=20, m<=20)
The winner is the athlete who has the maximum sum of results for all throws.
If we renumber the athletes with numbers from 0 to n-1, and the attempts of each of them – from 0 to m-1, then the program receives an array A[n][m] as input, consisting of non-negative integers (0<A[n][m]<500). The program must determine the line number with the maximum sum of numbers and display this amount and the line number for which this sum is reached.
Input data: The program receives as input two numbers n and m, which are the number of rows and columns in the array. Next in the input stream are n lines of m numbers, which are elements of the array.
Output data: Program should output 2 numbers: the amount and line number for which this amount is reached. If there are several such lines, then the number of the smallest of them is displayed.
Examples
| # |
Input |
Output |
| 1 |
4 3
5 6 7
6 6 7
766
4 3 5
| 19 1 |