13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T653,

This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543

You are given a table $$$A$$$ of integers $$$n \times m$$$. The cell $$$(x, y)$$$ is called Nash equilibrium if both of the following conditions hold:

for each $$$x_1 \neq x$$$ $$$A_{xy} \gt A_{x_1y}$$$;
for each $$$y_1 \neq y$$$ $$$A_{xy} \lt A_{xy_1}$$$.

Find a Nash equilibrium in $$$A$$$. If there exist several equilibria, print the one with minimum $$$x$$$. If still there are several possible answers, print the one with minimum $$$y$$$.

Input

The first line contains two integers $$$n, m$$$ ($$$2 \leq n, m \leq 1000$$$), denoting the size of the table.

Each of next $$$n$$$ lines contain $$$m$$$ space-separated integers $$$A_{ij}$$$ ($$$1 \leq A_{ij} \leq 10^9$$$).

Nash equilibrium

Examples