#include <bits/stdc++.h>
using namespace std;
long long int n, m, a, b;
long long int fn(vector<vector<long long int>> &A, long long int mid) {
  long long int i, j;
  vector<long long int> mask((1 << m), -1);
  for (i = 0; i < n; i++) {
    long long int ans = 0;
    for (j = 0; j < m; j++) {
      if (A[i][j] >= mid) ans = ans ^ (1 << j);
    }
    mask[ans] = i + 1;
  }
  if (mask[(1 << m) - 1] != -1) {
    a = mask[(1 << m) - 1];
    b = mask[(1 << m) - 1];
    return (1);
  }
  for (i = 0; i < (1 << m); i++) {
    for (j = 0; j < (1 << m); j++) {
      if (mask[i] != -1 && mask[j] != -1 && (i | j) == (1 << m) - 1) {
        a = mask[i];
        b = mask[j];
        return (1);
      }
    }
  }
  return (0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  cin.tie(NULL);
  long long int i, j, low = 1e11, mid, high = -1;
  cin >> n >> m;
  vector<vector<long long int>> A(n);
  vector<long long int> temp(m);
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      cin >> temp[j];
      high = max(high, temp[j]);
      low = min(low, temp[j]);
    }
    A[i] = temp;
  }
  while (low <= high) {
    mid = (low + high) / 2;
    if (fn(A, mid) == 1)
      low = mid + 1;
    else
      high = mid - 1;
  }
  cout << a << " " << b;
  return (0);
}
