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.*;
import java.util.*;
 
public class Main {
	public static int arr[][];
	public static int n,m;
	public static PrintWriter out;
	public static int ans[];
	public static boolean exists(int val)
	{
		int dp[] = new int[300];
		for(int i=0;i<300;i++) dp[i]=-1;
		int sum = 0;
		for(int i=0;i<n;i++)
		{
			sum=0;
			for(int j=0;j<m;j++)
			{
				if(arr[i][j]>=val)
					sum+=(1<<(m-1-j));
			}
			dp[sum]=i;
		}
		int compval = (1<<m) - 1;
		for(int i=0;i<300;i++)
		{
			for(int j=0;j<300;j++)
			{
				if(dp[i]!=-1 && dp[j]!=-1 && (compval==(int)(i|j)))
				{
					// out.println("YES");
					ans[0]=dp[i]+1; ans[1]=dp[j]+1;
					return true;
				}
			}
		}
		// out.println("yo");
		return false;
	}
	public static int binsearch(int low, int high)
	{
		if(low>high)
			return -1;
		int mid = (low+high)/2;
		if(exists(mid))
			return Math.max(mid,binsearch(mid+1,high));
		else
			return binsearch(low,mid-1);
	}
	public static void main(String[] args)throws IOException {
        InputReader in = new InputReader(System.in);
        out = new PrintWriter(System.out);
        
		n = in.nextInt();
		m = in.nextInt();
		arr = new int[n][m];
		ans = new int[2];
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
				arr[i][j]=in.nextInt();
		}
		binsearch(0,1000000000);
		out.println(ans[0]+" "+ans[1]);
        out.close();
	}
    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 {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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

    }

}