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 PYTHON):

Solution:
import os
import sys
from atexit import register
from io import BytesIO
sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
sys.stdout = BytesIO()
register(lambda: os.write(1, sys.stdout.getvalue()))
input = lambda: sys.stdin.readline().rstrip('\r\n')
raw_input = lambda: sys.stdin.readline().rstrip('\r\n')

n,m = map(int,raw_input().split(" "))
mat = []


base = [1<<i for i in range(8)]

def cal(arr):
	s = 0
	for i in range(m):
		s += base[i]*arr[i]
	return s

for i in range(n):
	mat.append(map(int,raw_input().split(" ")))

low = 0
high = int(1e9)

res = (1<<m) -1
a,b = 0,0
while low<=high:
	flag = False
	mask = [[0]*m for i in range(n)]
	dic = [0]*256
	mid = (low + high)/2
	for i in range(n):
		for j in range(m):
			if mat[i][j] >=mid:
				mask[i][j] = 1
			else:
				mask[i][j] = 0
		dic[cal(mask[i])] = i+1
	for i in range(256):
		if dic[i]<=0:
			continue
		for j in range(256):
			if dic[j] >0 and i|j ==res :
				flag = True
				a,b = dic[i],dic[j]
	if flag:
		low = mid+1
	else:
		high = mid-1
print a,b