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.math.*;
import java.io.*;

public class CF1288D {
	boolean check(int v) {
		boolean[] seen = new boolean[1 << m];
		for(int i = 0 ; i < n ; i++) {
			int mask = 0;
			for(int j = 0 ; j < m ; j++)
				if(a[i][j] >= v)
					mask |= (1 << j);
			seen[mask] = true;
		}
		for(int i = 0 ; i < (1 << m) ; i++)
			for(int j = 0 ; j < (1 << m) ; j++)
				if(seen[i] && seen[j] && (i | j) == FULL_MASK)
					return true;
		return false;
	}
	int FULL_MASK = 0;
	int n, m, a[][];
	public CF1288D() {
		FS scan = new FS();
		n = scan.nextInt();
		m = scan.nextInt();
		FULL_MASK = (1 << m) - 1;
		a = new int[n][m];
		for(int i = 0 ; i < n ; i++)
			for(int j = 0 ; j < m ; j++)
				a[i][j] = scan.nextInt();
		int lo = 0, hi = (int) 1e9;
		while(lo + 1 < hi) {
			int mid = (lo + hi) / 2;
			if(check(mid)) lo = mid;
			else hi = mid;
		}
		int best = lo;
		if(check(hi)) best = hi;
		int[] ids = new int[1 << m];
		Arrays.fill(ids, -1);
		for(int i = 0 ; i < n ; i++) {
			int mask = 0;
			for(int j = 0 ; j < m ; j++)
				if(a[i][j] >= best)
					mask |= (1 << j);
			ids[mask] = i;
		}
		int ans_i = -1;
		int ans_j = -1;
		for(int i = 0 ; i < (1 << m) ; i++) {
			for(int j = 0 ; j < (1 << m) ; j++) {
				if(ids[i] != -1 && ids[j] != -1 && (i | j) == FULL_MASK) {
					ans_i = ids[i] + 1;
					ans_j = ids[j] + 1;
				}
			}
		}
		System.out.println(ans_i + " " + ans_j);
	}
	class FS {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		public String next() {
			while(!st.hasMoreTokens()) {
				try { st = new StringTokenizer(br.readLine()); }
				catch(Exception e) { throw null; }
			}
			return st.nextToken();
		}
		public int nextInt() { return Integer.parseInt(next()); }
	}
	public static void main(String[] args) { new CF1288D(); }
}