#include <bits/stdc++.h>
using namespace std;
const int INF = 1061109567;
const long long LINF = 4557430888798830399ll;
const int MOD = 1000000007;
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  if (c == EOF) exit(0);
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    x = x * 10 + (c - '0');
    c = getchar();
  }
  assert(c != EOF);
}
int reads(char *s) {
  int l = 0;
  *s = getchar();
  if (*s == EOF) exit(0);
  while (*s != ' ' && *s != '\t' && *s != '\r' && *s != '\n' && *s != EOF) {
    ++s;
    ++l;
    *s = getchar();
  }
  assert(*s != EOF);
  *s = '\0';
  return l;
}
long long qpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
int a[300005][8];
int vis[1 << 8];
int b[2400005], btop;
int ansi, ansj;
int n, m;
bool check(int mid) {
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; ++i) {
    int cur = 0;
    for (int j = 0; j < m; ++j) cur = (cur << 1) | (a[i][j] >= mid);
    vis[cur] = i;
  }
  int all1 = (1 << m) - 1;
  for (int i = all1; i; --i) {
    if (!vis[i]) continue;
    for (int j = 0; j < m; ++j) {
      if ((i >> j) & 1) vis[i ^ (1 << j)] = vis[i];
    }
  }
  for (int i = 0; i < (1 << m); ++i) {
    if (!vis[i]) continue;
    int w = all1 ^ i;
    if (vis[w]) {
      ansi = vis[i];
      ansj = vis[w];
      return true;
    }
  }
  return false;
}
void bs() {
  int L = 1, R = btop;
  while (true) {
    int mid = (L + R) >> 1;
    if (mid == L) {
      if (check(R))
        return;
      else {
        assert(check(L));
        return;
      }
    }
    if (check(mid))
      L = mid;
    else
      R = mid - 1;
  }
}
void test_case() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < m; ++j) {
      read(a[i][j]);
      b[++btop] = a[i][j];
    }
  }
  sort(b + 1, b + 1 + btop);
  btop = unique(b + 1, b + 1 + btop) - (b + 1);
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < m; ++j)
      a[i][j] = lower_bound(b + 1, b + 1 + btop, a[i][j]) - b;
  }
  bs();
  printf("%d %d\n", ansi, ansj);
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    test_case();
  }
}
