#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long arr[300000][8];
long long a, b;
bool f(long long x, long long n, long long m) {
  vector<int> bitmasks(1 << m, -1);
  for (int i = 0; i < n; i++) {
    int bitmask = 0;
    for (int j = 0; j < m; j++) {
      if (arr[i][j] >= x) bitmask += (1 << (m - (j + 1)));
    }
    bitmasks[bitmask] = i + 1;
  }
  if (bitmasks.back() != -1) {
    a = b = bitmasks[(1 << m) - 1];
    return 1;
  }
  for (int i = 0; i < (1 << m); i++)
    for (int j = 0; j < (1 << m); j++)
      if (bitmasks[i] != -1 && bitmasks[j] != -1 &&
          ((i | j) == ((1 << m) - 1))) {
        a = bitmasks[i];
        b = bitmasks[j];
        return 1;
      }
  return 0;
}
int main() {
  cin >> n >> m;
  long long maxi = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      cin >> arr[i][j];
      maxi = max(maxi, arr[i][j]);
    }
  long long lo = 0;
  long long hi = maxi;
  a = n;
  b = n;
  while (lo < hi) {
    long long x = lo + (hi - lo + 1) / 2;
    if (f(x, n, m))
      lo = x;
    else
      hi = x - 1;
  }
  cout << a << " " << b << endl;
}
