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.*;
import java.io.*;

public class D80 {
    static long [][] a;
    static int n, m;
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        n = sc.nextInt(); m = sc.nextInt();
        a = new long[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) a[i][j] = sc.nextLong();
        }
        long lo = 0; long hi = (long) 1e9 + 17;
        long ct = 0;
        while (lo < hi) {
            long mid = (lo + hi) / 2;
            if (mid == lo) ct++;
            if (ct == 2) break;
            //int [] index = new int[(1 << m)];
            //Arrays.fill(index, -1);
            Set<Integer> valid = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int mask = 0;
                for (int j = 0; j < m; j++) {
                    if (a[i][j] >= mid) {
                        mask |= (1 << j);
                    }
                }
                //index[mask] = i;
                valid.add(mask);
            }
            boolean found = false;
            for (Integer i: valid) {
                for (Integer j: valid) {
                    if ((i | j) == (1 << m) - 1) found = true;
                }
            }
            if (found) {
                lo = mid;
            } else {
                hi = mid - 1;
            }
        }
        Set<Integer> valid = new HashSet<>();
        for (int i = 0; i < n; i++) {
            int mask = 0;
            for (int j = 0; j < m; j++) {
                if (a[i][j] >= hi) {
                    mask |= (1 << j);
                }
            }
            //index[mask] = i;
            valid.add(mask);
        }
        boolean found = false;
        for (Integer i: valid) {
            for (Integer j: valid) {
                if ((i | j) == (1 << m) - 1) found = true;
            }
        }
        if (found) {
            lo = hi;
        }


        int [] index = new int[(1 << m)];
        Arrays.fill(index, -1);
        valid = new HashSet<>();
        for (int i = 0; i < n; i++) {
            int mask = 0;
            for (int j = 0; j < m; j++) {
                if (a[i][j] >= lo) {
                    mask |= (1 << j);
                }
            }
            index[mask] = i;
            valid.add(mask);
        }
        for (Integer i: valid) {
            for (Integer j: valid) {
                if ((i | j) == (1 << m) - 1) {
                    out.println((index[i] + 1) + " " + (index[j] + 1));
                    out.close();
                    return;
                }
            }
        }
        out.close();
    }


    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

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


    }

}