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

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const double PI = acos(-1.0);
const int M = 10;
int mask[(1 << M)];
int ind[(1 << M)];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  int ar[n][m];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> ar[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < (1 << m); j++) {
      int mi = 1000000005;
      for (int k = 0; k < m; k++) {
        if ((1 << k) & j) {
          mi = min(mi, ar[i][k]);
        }
      }
      if (mask[j] < mi) {
        mask[j] = mi;
        ind[j] = i;
      }
    }
  }
  int ans = 0;
  int i1 = 0, i2 = 0;
  for (int i = 0; i < (1 << m); i++) {
    int m1 = i;
    int m2 = ((1 << m) - 1) ^ m1;
    if (min(mask[m1], mask[m2]) > ans) {
      ans = min(mask[m1], mask[m2]);
      i1 = ind[m1];
      i2 = ind[m2];
    }
  }
  cout << i1 + 1 << " " << i2 + 1 << "\n";
}