#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, true) : false;
}
const int nax = 3e5 + 10;
int x = -1, y = -1;
int A[nax][8];
int N, M;
bool check(int val) {
  vector<int> id(1 << M, -1);
  for (int i = 0; i < N; ++i) {
    int mask = 0;
    for (int j = 0; j < M; ++j)
      if (A[i][j] >= val) mask += (1 << j);
    id[mask] = i;
  }
  if (id[(1 << M) - 1] != -1) {
    x = y = id[(1 << M) - 1];
    return true;
  }
  for (int i = 0; i < (1 << M); ++i) {
    for (int j = i + 1; j < (1 << M); ++j) {
      if (id[i] != -1 && id[j] != -1 && ((i | j) == (1 << M) - 1)) {
        x = id[i], y = id[j];
        return true;
      }
    }
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> N >> M;
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < M; ++j) cin >> A[i][j];
  int l = -1, r = 1e9;
  while (l < r) {
    int m = (l + r + 1) >> 1;
    if (check(m))
      l = m;
    else
      r = m - 1;
  }
  cout << x + 1 << ' ' << y + 1 << '\n';
}
