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.io.*;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;

/*
Прокрастинирую
*/

public class Main {

    static FastReader in;
    static PrintWriter out;
    static Random rand = new Random();
    static final int INF = (int) (1e9 + 10);
    static final int MOD = (int) (1e9 + 7);
    static final int N = (int) (5e5 + 5);
    static final int LOGN = (int) (20);

    static void solve() {
        int n = in.nextInt();
        int m = in.nextInt();

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

        int[][] maxs = new int[1 << m][2];
        for (int mask = 0; mask < 1 << m; mask++) {
            maxs[mask][0] = -INF;
        }
        for (int i = 0; i < n; i++) {
            for (int mask = 1; mask < 1 << m; mask++) {
                int min = INF;
                for (int j = 0; j < m; j++) {
                    if ((mask & (1 << j)) != 0) {
                        min = Math.min(min, a[i][j]);
                    }
                }
                if (min > maxs[mask][0]) {
                    maxs[mask][0] = min;
                    maxs[mask][1] = i + 1;
                }
            }
        }

        int max = -INF, ans1 = -1, ans2 = -1;
        for (int mask = 1; mask < 1 << m; mask++) {
            int mask1 = ((1 << m) - 1) ^ mask;
            if (mask1 == 0) {
                if (maxs[mask][0] > max) {
                    max = maxs[mask][0];
                    ans1 = maxs[mask][1];
                    ans2 = maxs[mask][1];
                }
            } else {
                if (Math.min(maxs[mask][0], maxs[mask1][0]) > max) {
                    max = Math.min(maxs[mask][0], maxs[mask1][0]);
                    ans1 = maxs[mask][1];
                    ans2 = maxs[mask1][1];
                }
            }
        }

        out.println(ans1 + " " + ans2);
    }

    public static void main(String[] args) throws FileNotFoundException {
        in = new FastReader(System.in);
//        in = new FastReader(new FileInputStream("input.txt"));
        out = new PrintWriter(System.out);
//        out = new PrintWriter(new FileOutputStream("output.txt"));


        int q = 1;

        while (q-- > 0) {
            solve();
        }

        out.close();
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        FastReader(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        Integer nextInt() {
            return Integer.parseInt(next());
        }

        Long nextLong() {
            return Long.parseLong(next());
        }

        Double nextDouble() {
            return Double.parseDouble(next());
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(nextLine());
            }
            return st.nextToken();
        }

        String nextLine() {
            String s = "";
            try {
                s = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return s;
        }
    }
}