Given a N×M chessboard, where every cell has a value assigned to it denoted by A[i][j] (Cell in the ith row from top and jth column from left).
Find the position (x,y) where we should place the rook, just the sum of cells which are under attack of rook is maximum possible. The rook can not attack the cell on which it is placed.
If there are more than one positions for (x,y), return the position where x is as minimum as possible. If there are more than one positions with equal x, return the position where y is as minimum as possible.
Note:
Input
Output
Print two space separated integers x y denoting the rook's position.
Constrains
1≤N×M≤1061≤A[i][j]≤104