#include <bits/stdc++.h>
using namespace std;
int n, m, a[300005][10], l, r, md, arr[10000007], mn, jog, ans, nw, b, bit;
pair<int, int> dp[1 << 9];
bitset<9> bset;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      scanf("%d", &a[i][j]);
      arr[++nw] = a[i][j];
    }
  }
  for (int i = 1; i <= (1 << m); i++) {
    for (int j = 1; j <= n; j++) {
      mn = 1e9;
      for (int k = 1; k <= m; k++)
        if ((i & (1 << (k - 1)))) mn = min(a[j][k], mn);
      if (dp[i].first < mn) {
        dp[i].first = mn;
        dp[i].second = j;
      }
    }
  }
  sort(arr + 1, arr + 1 + nw);
  l = 1, r = nw;
  while (l <= r) {
    md = (l + r) / 2;
    b = 0;
    for (int i = 1; i <= n; i++) {
      bit = 0;
      for (int j = 1; j <= m; j++) {
        if (a[i][j] < arr[md]) {
          bit |= (1 << (j - 1));
        }
      }
      if (bit == 0) {
        b = 1;
        ans = i, jog = i;
      } else if (dp[bit].first >= arr[md]) {
        b = 1;
        ans = i, jog = dp[bit].second;
      }
    }
    if (b == 1)
      l = md + 1;
    else
      r = md - 1;
  }
  printf("%d %d", ans, jog);
}
