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.util.*;
import java.io.*;
 
public class Solution{
	long rem = 1000000007L;
	public Solution(){
		Scanner sc = new Scanner(System.in);
		int tests = 1;
        
        for(int t=1; t<=tests; t++){
			int n = sc.nextInt();
			int m = sc.nextInt();
			
			int[][] arr = new int[n][m];
			for(int i=0; i<n; i++){
				for(int j=0; j<m; j++){
					arr[i][j] = sc.nextInt();
				}
			}
			int start = 0;
			int end = 1000000000;
			int len = 1<<m;
			int[] masks = new int[len];
			int x = -1;
			int y = -1;
			
			while(start <= end){
				Arrays.fill(masks, -1);
				int mid = (start+end)>>1;
				boolean found = false;
				for(int i=0; i<n; i++){
					int mask = 0;
					for(int j=0; j<m; j++){
						if(arr[i][j] >= mid){
							mask |= (1<<j);
						}
					}
					masks[mask] = i;
				}
				
				for(int i=(len-1); i>=0; i--){
					if(masks[i] >= 0){
						for(int j=0; j<m; j++){
							masks[(i&(~(1<<j)))] = masks[i];
						}
					}
				}
				
				for(int i=(len-1); i>=0; i--){
					if(masks[i] >= 0){
						int sec = (len-1)^i;
						if(masks[sec] >= 0){
							x = masks[i];
							y = masks[sec];
							found = true;
						}
					}
				}
				
				if(found){
					start = mid+1;
				}
				else{
					end = mid-1;
				}
			}
			x++;
			y++;
			System.out.println(x + " " + y);
        }
	}
	
	public static void main(String[] args){
		new Solution();
	}
}