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.*;
import java.util.Map.Entry;
 
public class  gym{
	static int match(int mask1,int mask2,int len) {
		int resMask=0;
		for(int i=0;i<len;i++) {
			int bit1=((1<<i)&mask1);
			int bit2=((1<<i)&mask2);
			resMask|=bit1|bit2;
		}
		return resMask;
	}
	public static void main(String[] args) throws Exception{
		MScanner sc=new MScanner(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		int n=sc.nextInt(),m=sc.nextInt();
		int[][]in=new int[n][m];
		for(int i=0;i<n;i++) {
			in[i]=sc.takearr(m);
		}
		int lo=0;int hi=(int)1e9;
		int[]ans=new int[2];
		while(lo<=hi) {
			int mid=(lo+hi)>>1;
			boolean[]masks=new boolean[1<<m];
			int[]index=new int[1<<m];
			for(int i=0;i<n;i++) {
				int curMask=0;
				for(int j=0;j<m;j++) {
					if(in[i][j]>=mid) {
						curMask|=(1<<j);
					}
				}
				masks[curMask]=true;
				index[curMask]=i+1;
			}
			boolean yes=false;
			o:for(int mask1=0;mask1<(1<<m);mask1++) {
				if(masks[mask1]) {
					for(int mask2=mask1;mask2<(1<<m);mask2++) {
						if(masks[mask2]) {
							int resMask=match(mask1,mask2,m);
							if(resMask==(1<<m)-1) {
								yes=true;
								ans[0]=index[mask1];
								ans[1]=index[mask2];
								break o;
							}
							
						}
					}
				}
			}
			
			
			if(yes) {
				lo=mid+1;
			}
			else {
				hi=mid-1;
			}
			
		}
		pw.println(ans[0]+" "+ans[1]);
		pw.flush();
	}
	static class MScanner {
		StringTokenizer st;
		BufferedReader br;
		public MScanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
 
		public MScanner(String file) throws Exception {
			br = new BufferedReader(new FileReader(file));
		}
 
		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int[] takearr(int n) throws IOException {
	        int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public long[] takearrl(int n) throws IOException {
	        long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public Integer[] takearrobj(int n) throws IOException {
	        Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
	        return in;
		}
		public Long[] takearrlobj(int n) throws IOException {
	        Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
	        return in;
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
 
		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
 
		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
 
		public char nextChar() throws IOException {
			return next().charAt(0);
		}
 
		public Long nextLong() throws IOException {
			return Long.parseLong(next());
		}
 
		public boolean ready() throws IOException {
			return br.ready();
		}
 
		public void waitForInput() throws InterruptedException {
			Thread.sleep(3000);
		}
	}
}