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 = Integer.MAX_VALUE;
			int k = 0;
			for(int j=0; j<n; j++) {
				if(a[i][j] < min) {
					min = a[i][j];
					k = j;
				}
			}
			if(isMax(a,min,k,m)) {
				System.out.println(i+1+" "+(k+1));
			}
		}
		
		
	}

	public static boolean isMax(int[][] a, int min, int k, int m) {
		// TODO Auto-generated method stub
		for(int i=0; i<m; i++) {
			if(a[i][k] > min) {
				return false;
			}
		}
		return true;
	}
}