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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jaynil
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DMinimaxProblem solver = new DMinimaxProblem();
        solver.solve(1, in, out);
        out.close();
    }

    static class DMinimaxProblem {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            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 l = 0;
            int r = 1000000001;
            long ans = 0;
            long req = (long) Math.pow(2, m) - 1;
            int aa = 0;
            int bb = 0;
            while (l < r) {
                int mid = (l + r) / 2;
                HashSet<Integer> hs = new HashSet<>();
                HashMap<Integer, Integer> hmap = new HashMap<>();
                for (int i = 0; i < n; i++) {
                    StringBuilder temp = new StringBuilder();
                    for (int j = 0; j < m; j++) {
                        if (a[i][j] >= mid) {
                            temp.append("1");
                        } else {
                            temp.append("0");
                        }
                    }
                    hs.add(Integer.parseInt(temp.toString(), 2));
                    hmap.put(Integer.parseInt(temp.toString(), 2), i + 1);
                }
                boolean exi = false;
                for (int x : hs) {
                    for (int y : hs) {
                        if ((x | y) == req) {
                            aa = hmap.get(x);
                            bb = hmap.get(y);
                            exi = true;
                            break;
                        }
                    }
                }
                if (exi) {
                    ans = mid;
                    l = mid + 1;
                } else {
                    r = mid;
                }
            }
            out.println(aa + " " + bb);
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}