Problem: You are given n arrays a_1, a_2, ..., a_n; each array consists of exactly m integers. We denote the y-th element of the x-th array as a_{x, y}.

You have to choose two arrays a_i and a_j (1 ≤ i, j ≤ n, it is possible that i = j). After that, you will obtain a new array b consisting of m integers, such that for every k ∈ [1, m] b_k = max(a_{i, k}, a_{j, k}).

Your goal is to choose i and j so that the value of min _{k = 1}^{m} b_k is maximum possible.

Input

The first line contains two integers n and m (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ m ≤ 8) — the number of arrays and the number of elements in each array, respectively.

Then n lines follow, the x-th line contains the array a_x represented by m integers a_{x, 1}, a_{x, 2}, ..., a_{x, m} (0 ≤ a_{x, y} ≤ 10^9).

Output

Print two integers i and j (1 ≤ i, j ≤ n, it is possible that i = j) — the indices of the two arrays you have to choose so that the value of min _{k = 1}^{m} b_k is maximum possible. If there are multiple answers, print any of them.

Example

Input


6 5
5 0 3 1 2
1 8 9 1 3
1 2 3 4 5
9 1 0 3 7
2 3 0 6 3
6 4 1 7 0


Output


1 5

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Q1288D {
    public int[] check(int[] map, int m) {
        for (int i = map.length - 1; i >= 0; i--) {
            if (map[i] != 0) {
                for (int j = i; j < map.length; j++) {
                    if (map[j] != 0 && (i | j) == (1 << m) - 1) {
                        return new int[]{map[i], map[j]};
                    }
                }
            }
        }
        return null;
    }

    public void func(int[][] arr, int low, int high) {
        int[] ret = null;
        while (low <= high) {
            int mid = (low + high) / 2;
            int[] map = new int[(1 << arr[0].length)];
            for (int i = 0; i < arr.length; i++) {
                int mask = 0;
                for (int j = 0; j < arr[i].length; j++) {
                    mask <<= 1;
                    if (arr[i][j] >= mid) {
                        mask |= 1;
                    }
                }
                if (map[mask] == 0) {
                    map[mask] = i + 1;
                }
            }
            int[] r = check(map, arr[0].length);
            if (r != null) {
                low = mid + 1;
                ret = r;
            } else {
                high = mid - 1;
            }
        }
        System.out.println(ret[0] + " " + ret[1]);
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt(), m = scanner.nextInt(), low = Integer.MAX_VALUE, high = Integer.MIN_VALUE;
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                arr[i][j] = scanner.nextInt();
                low = Math.min(low, arr[i][j]);
                high = Math.max(high, arr[i][j]);
            }
        }
        new Q1288D().func(arr, low, high);
    }
}