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
{
	private void solve()throws Exception
	{
		int n=nextInt();
		int m=nextInt();

		int bigmask=0;
		for(int i=1;i<=m;i++)
			bigmask+=1<<i;

		ArrayList<Cell> list=new ArrayList<>();
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				list.add(new Cell(i,j,nextInt()));

		Collections.sort(list,(p,q)->-p.x+q.x);

		int row[]=new int[n+1];
		HashMap<Integer,Integer> map=new HashMap<>();

		for(int i=0;i<list.size();i++)
		{
			Cell cell=list.get(i);
			row[cell.r]+=1<<cell.c;
			map.put(row[cell.r],cell.r);

			for(int j:map.keySet())
				if((j|row[cell.r])==bigmask)
				{
					out.println(cell.r+" "+map.get(j));
					return;
				}
		}
	}
	class Cell
	{
		int r,c,x;
		Cell(int r,int c,int x)
		{
			this.r=r;
			this.c=c;
			this.x=x;
		}
	}

	 
	///////////////////////////////////////////////////////////

	public void run()throws Exception
	{
		br=new BufferedReader(new InputStreamReader(System.in));
		st=null;
		out=new PrintWriter(System.out);

		solve();
		
		br.close();
		out.close();
	}
	public static void main(String args[])throws Exception{
		new Main().run();
	}
	BufferedReader br;
	StringTokenizer st;
	PrintWriter out;
	String nextToken()throws Exception{
		while(st==null || !st.hasMoreTokens())
		st=new StringTokenizer(br.readLine());
		return st.nextToken();
	}
	String nextLine()throws Exception{
		return br.readLine();
	}
	int nextInt()throws Exception{
		return Integer.parseInt(nextToken());
	}
	long nextLong()throws Exception{
		return Long.parseLong(nextToken());
	}
	double nextDouble()throws Exception{
		return Double.parseDouble(nextToken());
	}
}