Rows with maximum sum#9564

Rows with maximum sum

1 second
128 megabytes
Very easy

A two-dimensional array of size n \times m is given. Find the rows whose elements have the maximum sum.

Input

The first line contains two integers, and — the number of rows and columns, respectively.

The next lines each contain integers representing the elements of the array.

The absolute value of each element does not exceed . Rows and columns are numbered starting from .

Output

Print in one line the numbers of all rows whose elements have the maximum sum.

Examples

Example 1

Loading
Loading