An automated greenhouse arranges its garden beds as an m x n grid of soil-moisture sensors. Each row of the grid is one bed; each entry in that row is a single sensor reading, either 0 (soil moisture is fine) or 1 (the sensor is flagging dryness). The greenhouse controller must decide which single bed the irrigation crew should visit first: the bed with the greatest number of flagged sensors. If two or more beds tie for the highest flagged-sensor count, the controller always prefers the bed that appears earliest in the grid (rows are 0-indexed from the top).

Input format

Line 1: two integers m and n -- the number of beds (rows) and the number of sensors per bed (columns). Each of the next m lines contains n integers, each 0 or 1, separated by spaces -- the sensor readings for that bed.

Output format

Print two integers separated by a space: the 0-based index of the bed with the most flagged sensors (ties broken by the smallest index), followed by the number of flagged sensors in that bed.

Constraints

• 1 <= m <= 1000
• 1 <= n <= 1000
• Every sensor reading is 0 or 1

2 4
0 0 0 1
1 0 1 1

1 3

3 2
0 0
1 0
0 1

1 1