#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<int>> table(n, vector<int>(m));
  for (auto& vec : table) {
    for (auto& val : vec) cin >> val;
  }
  vector<int> min_for_mask(1 << m, 0);
  vector<int> value_for_mask(1 << m, 0);
  value_for_mask[0] = 1000000000;
  for (int mask = 1; mask < (1 << m); ++mask) {
    int cur_min = 0;
    int i = 0;
    vector<int> pos;
    pos.reserve(__builtin_popcount(mask));
    for (int p = 0; p < m; ++p) {
      if (1 << p & mask) pos.push_back(p);
    }
    int ind = 0;
    for (const auto& vec : table) {
      int mn = 1000000000;
      for (int p : pos) {
        if (vec[p] < mn) mn = vec[p];
      }
      if (mn > cur_min) {
        cur_min = mn;
        i = ind;
      }
      ++ind;
    }
    min_for_mask[mask] = i;
    value_for_mask[mask] = cur_min;
  }
  int cur_res = 0;
  pair<int, int> an = {0, 0};
  int full = (1 << m) - 1;
  for (int i = 0; i < (1 << (m - 1)); ++i) {
    int rest = full ^ i;
    int ans = min(value_for_mask[i], value_for_mask[rest]);
    if (ans > cur_res) {
      cur_res = ans;
      an = {min_for_mask[i], min_for_mask[rest]};
    }
  }
  cout << an.first + 1 << ' ' << an.second + 1;
  return 0;
}
