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.Arrays;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
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 {
        PrintWriter out;
        InputReader in;
        int n;
        int m;
        int[][] arr;
        int ind1 = -1;
        int ind2 = -1;

        boolean check(int threshold) {
            int[] which = new int[1 << m];
            Arrays.fill(which, -1);
            int i = 0, j = 0;
            for (i = 0; i < n; i++) {
                int mask = 0;
                for (j = 0; j < m; j++) {
                    if (arr[i][j] >= threshold)
                        mask |= (1 << j);
                }
                which[mask] = i;
            }
            for (i = 0; i < (1 << m); i++) {
                for (j = 0; j < (1 << m); j++) {
                    if ((i | j) == ((1 << m) - 1) && which[i] != -1 && which[j] != -1) {
                        ind1 = which[i];
                        ind2 = which[j];
                        return true;
                    }
                }
            }
            return false;
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            n = ni();
            m = ni();
            arr = new int[n][m];
            int i = 0, j = 0;
            for (i = 0; i < n; i++) {
                for (j = 0; j < m; j++)
                    arr[i][j] = ni();
            }
            int lo = 0, hi = (int) 1e9;
            while (lo <= hi) {
                int mid = (lo + hi) >> 1;
                if (check(mid))
                    lo = mid + 1;
                else
                    hi = mid - 1;
            }
            pn((ind1 + 1) + " " + (ind2 + 1));

        }

        int ni() {
            return in.nextInt();
        }

        void pn(String zx) {
            out.println(zx);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

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

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}