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;
vector<vector<long>> input;
long n, m;
vector<long> makebool(long mid) {
  map<long, long> mp;
  vector<long> boolans;
  for (long i = 0; i < n; ++i) {
    long numbool = 0;
    for (long j = 0; j < m; ++j) {
      numbool = numbool << 1;
      if (mid <= input[i][j]) {
        numbool |= 1;
      }
    }
    if (mp[numbool] == 0) {
      mp[numbool] = 1;
      boolans.push_back(numbool);
    }
  }
  return boolans;
}
int checkbool(vector<long> &boolans) {
  long lim = (1 << m) - 1;
  long size = boolans.size();
  for (long i = 0; i < size; ++i) {
    for (long j = i; j < size; j++) {
      long res = boolans[i] | boolans[j];
      if (res == lim) {
        return 1;
      }
    }
  }
  return 0;
}
void printans(long mid) {
  map<long, long> mp;
  vector<long> boolans;
  for (long i = 0; i < n; ++i) {
    long numbool = 0;
    for (long j = 0; j < m; ++j) {
      numbool = numbool << 1;
      if (mid <= input[i][j]) {
        numbool |= 1;
      }
    }
    if (mp[numbool] == 0) {
      mp[numbool] = i;
      boolans.push_back(numbool);
    }
  }
  long lim = (1 << m) - 1;
  long size = boolans.size();
  for (long i = 0; i < size; ++i) {
    for (long j = i; j < size; j++) {
      long res = boolans[i] | boolans[j];
      if (res == lim) {
        cout << mp[boolans[i]] + 1 << " " << mp[boolans[j]] + 1 << endl;
        return;
      }
    }
  }
}
int main() {
  cin >> n >> m;
  input.resize(n, vector<long>(m));
  for (long i = 0; i < n; ++i) {
    for (long j = 0; j < m; ++j) {
      cin >> input[i][j];
    }
  }
  long low = 0, high = 1000000000;
  while (low < high) {
    long mid = (high + low) / 2 + 1;
    vector<long> boolans = makebool(mid);
    int chk = checkbool(boolans);
    if (chk) {
      low = mid;
    } else {
      high = mid - 1;
    }
  }
  vector<long> temp = makebool(low);
  if (!checkbool(temp)) {
    return 0;
  }
  printans(low);
  return 0;
}