In the castle hall of the miracles a rectangular floor is covered with tiles, and on each tile there are berries. The tortoise should get from the upper row of tiles to the bottom and wants to eat the most berries along the way. It can only move from the top row to the lower row and only along the paths indicated in the figure. Help the turtle to determine the tile in the upper row, from which, after reaching the bottom row, it will eat as many berries as possible. If there are several such tiles in the upper row, indicate the leftmost tile.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000) - the number of rows and columns in rectangular floor. Each of the next n lines contains m positive integers - the number of berries on corresponding tile.

Output

Print in one line the number of the tile in the upper row (numbering with 1), with which you must start to move the turtle to eat the maximum number of berries, and the number of berries that it will eat.