#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const int MX = 123456;
const int mod = (int)1e9 + 7;
const int base = 97;
const unsigned long long BS1 = 10000019ULL;
const int INF = (1 << 29);
template <class T>
inline void fastScan(T &x) {
  register char c = getchar();
  int neg = 0;
  x = 0;
  for (; (c < 48 || c > 57) && (c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
  if (neg) x = -x;
}
int n, m;
int l, r;
vector<vector<int> > inp;
int main() {
  fastScan(n);
  fastScan(m);
  inp.resize(n, vector<int>(m, 0));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      fastScan(inp[i][j]);
    }
  }
  int low = 0, high = 1e9, ans = 1e9;
  while (low <= high) {
    int mid = (low + high) >> 1;
    int possible = 0;
    vector<int> maskV(256, -1);
    for (int i = 0; i < n && !possible; i++) {
      int mask = 0, mn = 1e9;
      for (int j = 0; j < m; j++) {
        if (inp[i][j] >= mid) {
          mask |= (1 << j);
        }
        mn = min(mn, inp[i][j]);
      }
      maskV[mask] = i;
      if (mn >= mid) {
        possible = 1;
        l = i;
        r = i;
      }
    }
    for (int i = 0; i < 256 && !possible; i++) {
      for (int j = 0; j < 256 && !possible; j++) {
        if (maskV[i] != -1 && maskV[j] != -1) {
          if ((i | j) == (1 << m) - 1) {
            l = maskV[i];
            r = maskV[j];
            possible = 1;
          }
        }
      }
    }
    if (possible) {
      low = mid + 1;
      ans = mid;
    } else {
      high = mid - 1;
    }
  }
  printf("%d %d\n", l + 1, r + 1);
}
