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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

/**
 * Created by Katushka on 17.01.2020.
 */
public class MinimaxProblem {

    private static final Comparator<int[]> BY_FIRST = new Comparator<int[]>() {
        @Override
        public int compare(int[] o1, int[] o2) {
            return Integer.compare(o1[0], o2[0]);
        }
    };

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

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

        final int mLength = 1 << m;
        int[][] best = new int[mLength][2];

        int[][] a = new int[n][m];
        int[][][] sorted = new int[n][m][2];

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

            int[] current = new int[mLength];
            for (int i2 = 0; i2 < current.length; i2++) {
                current[i2] = -1;
            }
            Arrays.sort(sorted[i], BY_FIRST);
            for (int[] bi : sorted[i]) {
                int step = 1 << bi[1];
                for (int j = step; j < current.length; j += step) {
                    int j0 = j;
                    for (int k = j; k < j0 + step; k++) {
                        if (current[k] == -1) {
                            current[k] = bi[0];
                        }
                        j++;
                    }
                }
            }

            for (int j = 0; j < current.length; j++) {
                if (current[j] > best[j][0]) {
                    best[j][0] = current[j];
                    best[j][1] = i;
                }
            }

        }

        int currentMax = 0;
        int bestI = 0;
        int bestJ = 0;
        for (int i = 0; i < n; i++) {
            int bitmask = mLength - 1;
            for (int j = sorted[i].length - 1; j >= 0; j--) {
                if (sorted[i][j][0] <= currentMax) {
                    break;
                }

                if (j == 0) {
                    if (sorted[i][j][0] > currentMax) {
                        currentMax = sorted[i][j][0];
                        bestI = i;
                        bestJ = i;
                    }
                } else {
                    bitmask -= 1 << sorted[i][j][1];
                    if (best[bitmask][0] >= sorted[i][j][0]) {
                        currentMax = sorted[i][j][0];
                        bestI = best[bitmask][1];
                        bestJ = i;
                        break;
                    }
                }
            }

        }

        System.out.println((bestI + 1) + " " + (bestJ + 1));

    }

    private 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 {
                    final String str = reader.readLine();
                    tokenizer = new StringTokenizer(str);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextString() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

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

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

        public char nextChar() {
            return next().charAt(0);
        }
    }
}