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];
		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++) {
			int min = a[i][0];
			int pos = 0;
			for(int j = 1;j < n;j++) {
				if(a[i][j] < min) {
					min = a[i][j];
					pos = j;
				}
			}
			boolean isFlag = true;
			for(int j = 0;j < m;j++) {
				if(a[j][pos] > min) {
					isFlag = false;
					break;
				}
			}
			if(isFlag == true) {
				System.out.println((i+1)+" "+(pos+1));
			}
		}
	}
}