import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int m = in.nextInt();

        int[][] mA = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                mA[i][j] = in.nextInt();

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                int Max = -100000000;
                int Min = 100000000;
                for (int k = 0; k < m; k++)
                    Min = Math.min(mA[i][k], Min);

                for (int l = 0; l < n; l++)
                    Max = Math.max(mA[l][j], Max);


                if (mA[i][j] == Max && mA[i][j] == Min)
                    System.out.println((i + 1) + " " + (j + 1));

            }
        }
    }
}