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

Solution:
''' Hey stalker :) '''
INF = 10**10
def main():
    #print = out.append
    ''' Cook your dish here! '''
    n, m = get_list()
    mat = [get_list() for _ in range(n)]
    def fn(x):
        #print(x, end=": ")
        st = [-1]*(1<<m)
        st[0] = 0
        for index, li in enumerate(mat):
            no = 0
            for i, ele in enumerate(li):
                if ele>=x:
                    no |= 1<<i
            li = [0]
            k = 2**m -1 - no
            if st[k]>-1:
                #print(True, st[k], index)
                return True, st[k], index
            b = 0
            b = (b-no)&no
            while(b!=0):
                st[b] = index
                b = (b-no)&no
            # for i in range(m):
            #     if (no & (1<<i))==(1<<i):
            #         for j in range(len(li)):
            #             li.append(li[j] | 1<<i)
            #             st[li[-1]] = index
            continue
        return False, -1, -1
    x = 0
    base = 10**8
    while base>0:
        while fn(x+base)[0]: x+= base
        base //= 2
    res, a,b = fn(x)
    print(a+1, b+1)




''' Pythonista fLite 1.1 '''
import sys
#from collections import defaultdict, Counter
#from functools import reduce
#import math
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()
#[main() for _ in range(int(input()))]
#print(*out, sep='\n')