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>
template <typename X, typename Y>
X& remax(X& x, Y y) {
  return x = (y > x ? y : x);
}
const int N = 300300, M = 8;
int n, m, arr[N][M], dp[1 << 8], answI, answJ;
bool find(int min) {
  std::fill(dp, dp + (1 << 8), 0);
  for (int i = 1; i <= n; i++) {
    int mask = 0;
    for (int j = 0; j < m; j++) {
      mask |= (arr[i][j] >= min) << j;
    }
    dp[mask] = i;
  }
  for (int mask = (1 << m) - 2; mask >= 0; mask--) {
    for (int bit = 0; bit < m; bit++) {
      if (((mask >> bit) & 1) == 0) {
        remax(dp[mask], dp[mask ^ (1 << bit)]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    int mask = 0;
    for (int j = 0; j < m; j++) {
      mask |= (arr[i][j] >= min) << j;
    }
    mask = ~mask & ((1 << m) - 1);
    if (dp[mask]) {
      answI = i;
      answJ = dp[mask];
      return true;
    }
  }
  return false;
}
int main() {
  int low = 0, high = 0;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < m; j++) {
      scanf("%d", &arr[i][j]);
      remax(high, arr[i][j] + 1);
    }
  }
  while (high - low > 1) {
    int mid = (low + high) / 2;
    if (find(mid)) {
      low = mid;
    } else {
      high = mid;
    }
  }
  find(low);
  std::cout << answI << ' ' << answJ << std::endl;
  return 0;
}