View Code of Problem 85

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int m=scanner.nextInt();
		int n=scanner.nextInt();
		int a[][]=new int[m][n];
		int b[]=new int[m];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				a[i][j]=scanner.nextInt();
			}
		}
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				test(a,i,j);
			}
		}
	}
	public static void test(int a[][],int i,int j) {
		int min=0,max=0;
		for (int m = 0; m < a[0].length; m++) {
			if (a[i][min]>a[i][m]) {
				min=m;
			}
		}
		for (int m = 0; m < a.length; m++) {
			if (a[m][j]>a[max][j]) {
				max=m;
			}
		}
		if (min==j&&max==i) {
			System.out.printf("%d %d\n",i+1,j+1);
		}
	}
}