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 Main{

	static int low = 0, high = 1000000000;

	public static void main (String args[])throws IOException{
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);

		int n=sc.nextInt(), m=sc.nextInt(), arr[][]=new int[n][m];
		for(int i=0; i<n; i++)
			for(int j=0; j<m; j++)
				arr[i][j]= sc.nextInt();

		minimax(arr, low, high, -1, -1, m, n);


		out.flush();
	}	

	static void minimax(int[][] arr, int low, int high, int a, int b, int m, int n) {
		
		if(low>high) {
			System.out.println(a+" "+b);
			return;
		}
		
		int mid = (low+high)/2;
		int map[]=new int[(1<<m)+1];

		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);
			}
			map[mask]=i+1;
		}
		boolean f=false;
		for(int i=1; i<(1<<m); i++) {
			for(int j=1; j<(1<<m); j++) {
				if((i|j)==((1<<m)-1) && map[i]!=0 && map[j]!=0) {
					f=true;
					a=map[i];
					b=map[j];
				}
			}

		}
		if(f)
			minimax(arr, mid+1, high, a, b, m, n);
		else
			minimax(arr, low, mid-1, a, b, m, n);
	}
















	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String fileName) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(fileName));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

		int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

		boolean ready() throws IOException {
			return br.ready();
		}

	}

	static void sort(int[] a) {
		shuffle(a);
		Arrays.sort(a);
	}

	static void shuffle(int[] a) {
		int n = a.length;
		Random rand = new Random();
		for (int i = 0; i < n; i++) {
			int tmpIdx = rand.nextInt(n);
			int tmp = a[i];
			a[i] = a[tmpIdx];
			a[tmpIdx] = tmp;
		}
	}
}