#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
int n, m;
long long a[300010][10];
long long can = 0, ansi, ansj;
bool check(long long num) {
  vector<bool> v((1 << m), false);
  for (int i = 0; i < n; i++) {
    int bit = 0;
    for (int j = 0; j < m; j++) {
      if (a[i][j] >= num) {
        bit += (1 << j);
      }
    }
    v[bit] = true;
  }
  vector<bool> vv((1 << m), false);
  for (int i = 0; i < (1 << m); i++) vv[i] = v[i];
  for (int i = 0; i < (1 << m); i++) {
    for (int j = i + 1; j < (1 << m); j++) {
      if (v[i] and v[j]) vv[i | j] = true;
    }
  }
  return (vv[(1 << m) - 1]);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  long long lw = 0, hi = LINF, ok = 0;
  while (hi - lw > 1) {
    long long mid = (hi + lw) / 2;
    if (check(mid))
      lw = mid;
    else
      hi = mid;
  }
  vector<int> v((1 << m), -1);
  for (int i = 0; i < n; i++) {
    int bit = 0;
    for (int j = 0; j < m; j++) {
      if (a[i][j] >= lw) {
        bit += (1 << j);
      }
    }
    v[bit] = i;
  }
  for (int i = 0; i < (1 << m); i++) {
    for (int j = i; j < (1 << m); j++) {
      if (v[i] >= 0 and v[j] >= 0 and (i | j) == ((1 << m) - 1)) {
        cout << v[i] + 1 << ' ' << v[j] + 1 << endl;
        return 0;
      }
    }
  }
  return 0;
}
