#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
int n, m, a[300005][15];
int giao[1 << 15];
int ans1, ans2;
inline bool check(int x) {
  int cdt = 1 << m;
  memset(giao, 0, sizeof(giao));
  for (int i = 1; i <= n; i++) {
    int t = 0;
    for (int j = 1; j <= m; j++) {
      if (a[i][j] >= x) {
        t += 1 << (j - 1);
      }
    }
    giao[t] = i;
  }
  for (int i = 0; i < cdt; i++) {
    for (int j = 0; j < cdt; j++) {
      if (giao[i] && giao[j] && (i | j) == cdt - 1) {
        ans1 = giao[i];
        ans2 = giao[j];
        return false;
      }
    }
  }
  return true;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> a[i][j];
    }
  }
  int l = 0, r = inf;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid))
      r = mid - 1;
    else
      l = mid + 1;
  }
  cout << ans1 << " " << ans2 << endl;
  return 0;
}
