#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)3e5;
int n, m;
long long val[(1 << 8) + 5], koji[(1 << 8) + 5];
long long sol = -1;
pair<int, int> res = make_pair(1, 1);
vector<int> v;
const long long inf = (long long)1e9 + 5;
void solve(long long mask, long long first, long long sad, int idx) {
  if (first == m) {
    sad = min(sad, val[mask]);
    if (koji[mask] && sad > sol) {
      sol = sad;
      res = make_pair(idx, koji[mask]);
    }
    return;
  }
  solve(mask, first + 1, min(sad, (long long)v[first]), idx);
  solve(mask | (1 << first), first + 1, sad, idx);
}
void procesiraj(long long mask, long long first, long long sad, int idx) {
  if (first == m) {
    if (sad >= val[mask]) {
      val[mask] = sad;
      koji[mask] = idx;
    }
    return;
  }
  procesiraj(mask, first + 1, sad, idx);
  procesiraj(mask | (1 << first), first + 1, min(sad, (long long)v[first]),
             idx);
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    v.clear();
    for (int j = 0; j < m; ++j) {
      int first;
      scanf("%d", &first);
      v.push_back(first);
    }
    solve(0, 0, inf, i);
    procesiraj(0, 0, inf, i);
  }
  printf("%d %d", res.first, res.second);
  return 0;
}
