Find Special Node in Matrix in Better than O(n^2) Time

Question

M is an n*n matrix of integers. If M[i][i] < M[j][i] and M[i][i] >= M[i][j] for all j != i, M[i][i]<