1288_D. Minimax Problem_5173
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
import java.util.*;
import java.io.*;
public class D {
	
	static long mod = 1000000007;
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[][] mat = new int[n][m];
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < m; j++) {
				mat[i][j] = sc.nextInt();
			}
		}
		int a = 0;
		int b = 1000000001;
		while(b - a > 1) {
			int c = (a+b)/2;
			HashSet<Integer> set = new HashSet<>();
			for(int i = 0; i < n; i++) {
				int con = convert(mat[i], c);
				set.add(con);
			}
			boolean valid = false;
			for(int x: set) {
				for(int y: set) {
					if( (x | y) == (1 << m) - 1 ) {
						valid = true;
					}
				}
				if(valid) break;
			}
			if(valid) a = c;
			else b = c;
		}
		
		HashMap<Integer, Integer> map = new HashMap<>();
		for(int i = 0; i < n; i++) {
			int con = convert(mat[i], a);
			map.put(con, i);
		}
		int s = -1, t = -1;
		for(int x: map.keySet()) {
			for(int y: map.keySet()) {
				if( (x | y) == (1 << m) - 1 ) {
					s = map.get(x);
					t = map.get(y);
					break;
				}
			}
			if(s >= 0) break;
		}
		System.out.printf("%d %d\n", s+1, t+1);
		
	}
	static int convert(int[] arr, int x) {
		int res = 0;
		int n = arr.length;
		for(int i = 0; i < n; i++) {
			res <<= 1;
			if(arr[i] >= x) res |= 1;
		}
		return res;
	}
	
	static class FastScanner {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public FastScanner() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32768);
			tokenizer = null;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public String nextLine() {
			try {
				return reader.readLine();
			} catch(IOException e) {
				throw new RuntimeException(e);
			}
		}
	}


}
