Problem

7 /11


The line with the minimum amount

Problem

Write a program that finds the row with the minimum sum in a matrix.

Input
The first line contains the dimensions of the matrix separated by a space: the number of rows N and the number of columns M  (\(1 <= N, M <= 100 \)). The following N lines contain matrix rows, each – by M natural numbers separated by spaces.

Imprint
The program should display all elements of the found string with the minimum sum, separating them with spaces. If there are several rows with the same minimum sum, you need to select the row with the minimum index from them.
 

Examples
# Input Output
1 4 5
1 3 2 54 234
75 12 3 46 9
13 26 56 9 12
14 90 897 6 34
13 26 56 9 12