B'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 x m . The cell (x, y) is called Nash equilibrium if both of the following conditions hold: 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 . The first line contains two integers n, m ( 2 <= q n, m <= q 1000 ), denoting the size of the table. Each of next n lines contain m space-separated integers A_{ij} ( 1 <= q A_{ij} <= q 10^9 ). Output x and y -- the coordinates of the lexicographically minimum Nash equilibrium in the table. In case there is no answer, print two zeroes instead. '...