#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  a = a % 1000000007;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
      b--;
    }
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long fermat_inv(long long y) { return power(y, 1000000007 - 2); }
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    int n, m;
    cin >> n >> m;
    int a[n + 1][m];
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < m; j++) cin >> a[i][j];
    long long l = 1;
    long long r = 1000000000;
    int x1, x2;
    x1 = x2 = 1;
    while (l <= r) {
      long long mid = (l + r) / 2;
      vector<int> b1(256, 0);
      for (int i = 1; i <= n; i++) {
        long long val = 0ll;
        for (int j = 0; j < m; j++) {
          val *= 2ll;
          if (a[i][j] >= mid) val += 1;
        }
        b1[val] = i;
      }
      int check = 0;
      for (int i = 0; i < 256 && check == 0; i++) {
        if (b1[i] != 0) {
          for (int j = 0; j < 256; j++) {
            if (b1[j] != 0 && (i | j) == (1 << m) - 1) {
              x1 = b1[i];
              x2 = b1[j];
              check = 1;
              break;
            }
          }
        }
      }
      if (check == 1)
        l = mid + 1;
      else
        r = mid - 1;
    }
    cout << x1 << " " << x2 << "\n";
  }
  return 0;
}
