Pair of Sequences

You are given $M$ sequences $P_1, P_2, \ldots, P_M$, each of length $N$.

For two sequences $A$ and $B$ of length $N$, define $f(A,B)$ as follows:

• $f(A,B)=\max_{1 \le k \le N}(A_k+B_k)$

Choose two distinct integers $i,j$ so that $f(P_i,P_j)$ is maximized.

Find any such pair $i,j$.

The input is given in the following format.

$N\ M$ $P_{1,1}\ P_{1,2}\ \cdots\ P_{1,N}$ $P_{2,1}\ P_{2,2}\ \cdots\ P_{2,N}$ $\vdots$ $P_{M,1}\ P_{M,2}\ \cdots\ P_{M,N}$

Print two distinct integers $i,j$ such that $f(P_i,P_j)$ is maximized.

If there are multiple valid answers, you may print any of them.

• $1 \le N \le 5,000$.
• $2 \le M \le 5,000$.
• $-1,000,000,000 \le P_{i,j} \le 1,000,000,000$ ($1 \le i \le M$, $1 \le j \le N$).