#include <bits/stdc++.h>
using namespace std;
template <typename T>
void _dbg(const char* _s, T _h) {
  cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char* _s, T _h, Ts... _t) {
  int _b = 0;
  while (((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',') cerr << *_s++;
  cerr << " = " << _h << ",";
  _dbg(_s + 1, _t...);
}
const int64_t INF = static_cast<int64_t>(1e9) + 7;
const int64_t LINF = INF * INF;
const int MAXN = static_cast<int>(1e6) + 17;
void solve() {
  int n, m;
  cin >> n >> m;
  int ai = 0, aj = 0;
  int bnd = (1 << m);
  vector<int> nums(m), cur;
  vector<pair<int, int>> vec(bnd, {0, 0});
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    cur.assign(bnd, INF);
    for (int j = 0; j < m; ++j) {
      cin >> nums[j];
    }
    for (int j = 0; j < bnd; ++j) {
      for (int k = 0; k < m; ++k) {
        if (j & (1 << k)) {
          cur[j] = min(cur[j], nums[k]);
        }
      }
    }
    for (int j = 0; j < bnd; ++j) {
      int cand = min(vec[j].first, cur[bnd - 1 - j]);
      if (cand > ans) {
        ans = cand;
        ai = vec[j].second;
        aj = i;
      }
      if (cur[j] > vec[j].first) {
        vec[j].first = cur[j];
        vec[j].second = i;
      }
    }
  }
  cout << ai + 1 << ' ' << aj + 1 << '\n';
}
int main() {
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios_base::sync_with_stdio(false);
  int q = 1;
  for (int i = 0; i < q; ++i) {
    solve();
  }
}
