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:
from collections import Counter
n,m=map(int, raw_input().split())
l=[]
for i in range(n):
    l.append(map(int,raw_input().split()))
def check(x):
    d=Counter()
    ind=1
    for i in l:
        c=0
        for j in xrange(m):
            if i[j]>=x:
                c+=1<<j
        d[c]=ind
        ind+=1
    k=d.keys()
    #k.sort()
    n1=len(k)
    #print d,x
    for i in xrange(n1):
        for j in xrange(i,n1):
            if k[i]|k[j]==pow(2,m)-1:
                return (d[k[i]],d[k[j]])
    return 0

l1=0
r1=1000000000
ans=(1,1)
f=0
while l1<=r1:
    mid=(l1+r1)/2
    temp=check(mid)
    if temp:
        ans=temp
        l1=mid+1
    else:
        r1=mid-1
print ans[0],ans[1]