Problem: You are given n arrays a_1, a_2, ..., a_n; each array consists of exactly m integers. We denote the y-th element of the x-th array as a_{x, y}.

You have to choose two arrays a_i and a_j (1 ≤ i, j ≤ n, it is possible that i = j). After that, you will obtain a new array b consisting of m integers, such that for every k ∈ [1, m] b_k = max(a_{i, k}, a_{j, k}).

Your goal is to choose i and j so that the value of min _{k = 1}^{m} b_k is maximum possible.

Input

The first line contains two integers n and m (1 ≤ n ≤ 3 ⋅ 10^5, 1 ≤ m ≤ 8) — the number of arrays and the number of elements in each array, respectively.

Then n lines follow, the x-th line contains the array a_x represented by m integers a_{x, 1}, a_{x, 2}, ..., a_{x, m} (0 ≤ a_{x, y} ≤ 10^9).

Output

Print two integers i and j (1 ≤ i, j ≤ n, it is possible that i = j) — the indices of the two arrays you have to choose so that the value of min _{k = 1}^{m} b_k is maximum possible. If there are multiple answers, print any of them.

Example

Input


6 5
5 0 3 1 2
1 8 9 1 3
1 2 3 4 5
9 1 0 3 7
2 3 0 6 3
6 4 1 7 0


Output


1 5

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.math.*;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
public class Main {

  static int [][]a;
  static int n;
  static int m;
  static int i1 = 0;
  static int i2 = 0;
  static boolean work(int mid) {
    int []ma = new int[1<<m];
    Arrays.fill(ma, -1);
    for (int i = 0;i < n;++i) {
      int tmp = 0;
      for (int j = 0;j < m;++j) {
        if (a[i][j] >= mid) {
          tmp |= (1<<j);
        }
      }
      //System.out.println(tmp);
      if (ma[tmp] == -1) ma[tmp] = i;
    }

    //System.out.print(Arrays.toString(ma));
    for (int i = 0;i < (1<<m);++i) {
      if (ma[i] < 0) continue;
      for (int j = i;j < (1<<m);++j) {
        if (ma[j] < 0) continue;
        if ((i | j) == ((1<<m) - 1)) {
          i1 = ma[i] + 1;
          i2 = ma[j] + 1;
          return true;
        }
      }
    }
    return false;
  }
  public static void main(String[] args) {
    try {
      MScanner in = new MScanner(System.in);
      BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out, "UTF-8"));
      n = in.nextInt();
      m = in.nextInt();
      a = new int [n][m];
      for (int i = 0;i < n;++i) {
        for (int j = 0;j < m;++j) {
          a[i][j] = in.nextInt();
        }
      }
      int l = 0;
      int r = 1000000000;
      int s = 0;
      while (l <= r) {
        //System.out.println(l + " " + r);
        int mid = (l + r) / 2;
        if (work(mid)) {
          s = mid;
          l = mid + 1;
        } else {
          r = mid - 1;
        }
      }
      work(s);
      
      System.out.println(i1 + " " + i2);
    } catch (Exception e) {
      e.printStackTrace();
    }
  }
  static class MScanner {
    StringTokenizer st;
    BufferedReader br;
    public MScanner(InputStream system) {
      br = new BufferedReader(new InputStreamReader(system));
    }
 
    public MScanner(String file) throws Exception {
      br = new BufferedReader(new FileReader(file));
    }
 
    public String next() throws IOException {
      while (st == null || !st.hasMoreTokens())
        st = new StringTokenizer(br.readLine());
      return st.nextToken();
    }
    public int[] takearr(int n) throws IOException {
      int[]in=new int[n];for(int i=0;i<n;i++)in[i]=nextInt();
      return in;
    }
    public long[] takearrl(int n) throws IOException {
      long[]in=new long[n];for(int i=0;i<n;i++)in[i]=nextLong();
      return in;
    }
    public Integer[] takearrobj(int n) throws IOException {
      Integer[]in=new Integer[n];for(int i=0;i<n;i++)in[i]=nextInt();
      return in;
    }
    public Long[] takearrlobj(int n) throws IOException {
      Long[]in=new Long[n];for(int i=0;i<n;i++)in[i]=nextLong();
      return in;
    }
    public String nextLine() throws IOException {
      return br.readLine();
    }
 
    public int nextInt() throws IOException {
      return Integer.parseInt(next());
    }
 
    public double nextDouble() throws IOException {
      return Double.parseDouble(next());
    }
 
    public char nextChar() throws IOException {
      return next().charAt(0);
    }
 
    public Long nextLong() throws IOException {
      return Long.parseLong(next());
    }
 
    public boolean ready() throws IOException {
      return br.ready();
    }
 
    public void waitForInput() throws InterruptedException {
      Thread.sleep(3000);
    }
  }
}