Saddle point

A saddle point of a matrix is an element that is the smallest in its row (no element of the row is smaller) and the largest in its column (no element of the column is larger).

You are given an $m \times n$ matrix. Find the row and column numbers of the first saddle point in row order (left to right, top to bottom). If there is none — -1.

The first line contains $m$ and $n$ ($1 \le m, n \le 100$). The next $m$ lines contain the matrix ($|a_{ij}| \le 10^9$).

A single line with two numbers — the row and the column (from $1$), or -1.

Precompute the minimum of every row and the maximum of every column — then each element is checked with two comparisons. In the first example $7$ is the minimum of row 3 and the maximum of column 1 — the answer is 3 1. The second example has no saddle point.