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:
//created by Whiplash99
import java.io.*;
import java.util.*;
public class A
{
    private static int x,y;
    private static void bSearch(int[][] a, int N, int M)
    {
        int l=0,r=(int)1e9,mid;
        HashSet<Integer> set=new HashSet<>();
        ArrayList<Integer> list=new ArrayList<>();
        ArrayList<Integer> pos=new ArrayList<>();

        while (l<=r)
        {
            mid=(l+r)/2;
            set.clear(); list.clear(); pos.clear();

            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;
                }

                if(!set.contains(mask))
                {
                    list.add(mask);
                    pos.add(i);
                }

                set.add(mask);
            }

            boolean flag=false;
            for(int i=0;i<list.size();i++)
            {
                for(int j=i;j<list.size();j++)
                {
                    if((list.get(i)|list.get(j))==(1<<M)-1)
                    {
                        flag=true;
                        x=pos.get(i); y=pos.get(j);
                    }
                }
            }

            if(flag) l=mid+1;
            else r=mid-1;
        }
    }
    public static void main(String[] args) throws Exception
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

        int i,N;

        String[] s=br.readLine().trim().split(" ");
        N=Integer.parseInt(s[0]);
        int M=Integer.parseInt(s[1]);

        int[][] a=new int[N][M];
        for(i=0;i<N;i++)
        {
            s=br.readLine().trim().split(" ");
            for(int j=0;j<M;j++) a[i][j]=Integer.parseInt(s[j]);
        }

        bSearch(a,N,M); x++; y++;
        System.out.println(x+" "+y);
    }
}