#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int> > v;
int A = -1, B = -1;
bool ok(int val) {
  int MaxMask = (1 << m);
  int off[(1 << m)];
  for (int i = 0; i < (1 << m); ++i) {
    off[i] = -1;
  }
  for (int i = 0; i < n; ++i) {
    int mask = 0;
    for (int j = 0; j < m; ++j) {
      if (v[i][j] >= val) {
        mask |= (1 << j);
      }
    }
    off[mask] = i;
  }
  if (off[(1 << m) - 1] != -1) {
    A = off[(1 << m) - 1];
    B = off[(1 << m) - 1];
    return true;
  }
  for (int mask = 0; mask < (1 << m); ++mask) {
    if (off[mask] == -1) continue;
    for (int mask2 = 0; mask2 < (1 << m); ++mask2) {
      if (off[mask2] == -1 || (mask | mask2) != ((1 << m) - 1)) continue;
      A = off[mask];
      B = off[mask2];
      return true;
    }
  }
  return false;
}
void solve() {
  cin >> n >> m;
  v.assign(n, vector<int>(m, 0));
  int Max = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> v[i][j];
      Max = max(Max, v[i][j]);
    }
  }
  int L = 0, R = Max + 1;
  while (L + 1 < R) {
    int M = (L + R) / 2;
    if (ok(M)) {
      L = M;
    } else {
      R = M;
    }
  }
  ok(L);
  cout << A + 1 << " " << B + 1 << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
