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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/*
1
2 3
 */
public class D {

	static int ind1, ind2;
	
	public static void main(String[] args) {
		FastScanner fs=new FastScanner();
		int n=fs.nextInt(), m=fs.nextInt();
		
		int[][] arrays=new int[n][m];
		for (int i=0; i<n; i++)
			for (int j=0; j<m; j++)
				arrays[i][j]=fs.nextInt();
		int low=0, high=1000_000_001;
		while (low!=high) {
			int mid=(low+high+1)/2;
			if (possible(mid, arrays, n, m)) {
				low=mid;
			}
			else {
				high=mid-1;
			}
		}
		possible(low, arrays, n, m);
		System.out.println(ind1+" "+ind2);
	}
	
	static boolean possible(int min, int[][] arrays, int n, int m) {
		boolean[] possible=new boolean[1<<m];
		int[] used=new int[1<<m];
		int arrayInd=0;
		for (int[] a:arrays) {
			arrayInd++;
			int mask=0;
			for (int i=0; i<m; i++)
				if (a[i]>=min) mask+=1<<i;
			possible[mask]=true;
			used[mask]=arrayInd;
		}
		for (int i=0; i<1<<m; i++)
			for (int j=0; j<1<<m; j++)
				if (possible[i]&&possible[j]&&((i|j)==((1<<m)-1))) {
					ind1=used[i];
					ind2=used[j];
					return true;
				}
		return false;
	}
	
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		
		String next() {
			while (!st.hasMoreElements())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
	}

}