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>
using namespace std;
int n, m, t[300005][10], idx[1001301];
pair<long long, int> check(int M) {
  for (int i = 0; i < (1 << m); i++) idx[i] = 0;
  for (int i = 1; i <= n; i++) {
    int val = 0;
    for (int j = 1; j <= m; j++) val = val * 2 + (t[i][j] >= M ? 1 : 0);
    idx[val] = i;
  }
  for (int i = 0; i < (1 << m); i++) {
    if (!idx[i]) continue;
    for (int j = 0; j < (1 << m); j++) {
      if (!idx[j]) continue;
      if ((i | j) == (1 << m) - 1) return {idx[i], idx[j]};
    }
  }
  return {0, 0};
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> t[i][j];
    }
  }
  int l = 0;
  int p = 1e9;
  int mid = (l + p + 1) / 2;
  while (l != p) {
    pair<long long, int> kek = check(mid);
    if (kek.first != 0)
      l = mid;
    else
      p = mid - 1;
    mid = (l + p + 1) / 2;
  }
  pair<long long, int> res = check(mid);
  cout << res.first << " " << res.second << "\n";
}