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

public class Main
{
	PrintWriter out = new PrintWriter(System.out);
	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer tok = new StringTokenizer("");
    String next() throws IOException {
        if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }
        return tok.nextToken();
    }
    int ni() throws IOException { return Integer.parseInt(next()); }
    long nl() throws IOException { return Long.parseLong(next()); }
  
    void solve() throws IOException {
        int n=ni(),m=ni();
        int[][]A=new int[n*m][3];
        for (int x=0;x<n;x++) {
            for (int y=0;y<m;y++) {
                A[x*m+y][0]=ni();
                A[x*m+y][1]=x+1;
                A[x*m+y][2]=y;
            }
        }
        
        Arrays.sort(A,(a,b)->Integer.compare(b[0],a[0]));
        
        int p=0;
        HashMap<Integer,Integer>H=new HashMap();
        int[]G=new int[n+1];
        int target=(1<<m)-1;
        int ans=0;
        int a2=0;
        
        while (p<n*m) {
            int v=A[p][1];
            int nm=A[p][2];
            p++;
            int x=1<<nm;
            G[v]=G[v]|x;
            if (H.containsKey(G[v])) continue;
            if (G[v]==target) { ans=v; a2=v; break; }
            H.put(G[v],v);
            if (H.containsKey(target&(~G[v]))) { ans=H.get(target&(~G[v])); a2=v; break; }
        }
        
        System.out.println(ans+" "+a2);
    }

    public static void main(String[] args) throws IOException {
        new Main().solve();
    }
}