#include <bits/stdc++.h>
bool local = false;
using namespace std;
template <class T>
string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
void print(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x << ' ';
  cout << "\n";
};
template <class T>
void print1(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x + 1 << ' ';
  cout << "\n";
};
template <class T1, class T2>
ostream &operator<<(ostream &o, pair<T1, T2> x) {
  return o << x.first << ' ' << x.second;
}
template <class T1, class T2>
istream &operator>>(istream &o, pair<T1, T2> &x) {
  return o >> x.first >> x.second;
}
template <class T1, class T2>
pair<T1, T2> operator+(pair<T1, T2> a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
  return a;
}
template <class T1, class T2>
pair<T1, T2> operator-(pair<T1, T2> a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
  return a;
}
template <class T1, class T2>
void operator+=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
}
template <class T1, class T2>
void operator-=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
}
int nint() {
  int x;
  cin >> x;
  return x;
}
double getTime() { return clock() / (double)CLOCKS_PER_SEC; };
mt19937 rnd(0);
int rand(int n) { return rnd() % n; }
int rand(int l, int r) { return rnd() % (r - l + 1) + l; }
const int mod = 1000000000 + 7;
void initIO() {
  if (local) {
    freopen("input.txt", "r", stdin);
    srand((int)time(0));
    rnd.seed((int)time(0));
  } else {
    {
      ios::sync_with_stdio(0);
      cin.tie(0);
      cout.tie(0);
    };
  }
}
void solve();
signed main() {
  initIO();
  int tc = 1;
  for (int tt = 0; tt < (tc); tt++) {
    solve();
  }
  if (local)
    cout << "\n"
         << "time = " << getTime() << "\n";
}
int n;
int m;
int a[300500][8];
int id[1024];
int x1, x2;
int check(int x) {
  memset(id, -1, sizeof(id));
  for (int i = 0; i < (n); i++) {
    int o = 0;
    for (int j = 0; j < (m); j++)
      if (a[i][j] >= x) o |= (1 << j);
    id[o] = i;
  }
  for (int i = 0; i < ((1 << m)); i++)
    for (int j = 0; j < ((1 << m)); j++) {
      if (id[i] != -1 && id[j] != -1 && ((i | j) + 1 == (1 << m))) {
        x1 = id[i];
        x2 = id[j];
        return 1;
      }
    }
  return 0;
}
void solve() {
  cin >> n >> m;
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (m); j++) cin >> a[i][j];
  int l = 0, r = mod, ans = 0;
  while (l <= r) {
    int c = (l + r) / 2;
    if (check(c)) {
      ans = c;
      l = c + 1;
    } else
      r = c - 1;
  }
  check(ans);
  cout << x1 + 1 << ' ' << x2 + 1;
}
