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.*;
 
public class Main {
    public static void main(String[] args) throws IOException {
        PrintWriter out = new PrintWriter(System.out);
        //Scanner sc = new Scanner();
        Reader in = new Reader();
        Main solver = new Main();
        solver.solve(out, in);
        out.flush();
        out.close();
 
    }
 
    static long INF = (long)1e18;
    static int maxn = (int)1e9;
    static int mod  = (int)1e9+7;
    static int n,m,k,t,q,d,p;
    
    static int arr[][],s[];
    static boolean[] tmp;
    static int l=0,r=0;
    
    void solve(PrintWriter out, Reader in) throws IOException{
        n = in.nextInt();
        m = in.nextInt();
        
        tmp = new boolean[1<<m];
        s = new int[n];
        arr = new int[n][m];
        for (int i = 0; i < n; i++) {
          for (int j = 0; j < m; j++) {
              arr[i][j] = in.nextInt();
          }
        }
        
        int lo = 0, hi = maxn, mid, ans = 0;
        while (lo <= hi) {
            mid = (lo + hi)/2;
            if (check(mid)) {
                lo = mid+1;
                ans = mid;
            } else {
                hi = mid-1;
            }
        }
        
        out.println(l+" "+r);  
    }
    
    
    static boolean check(int x) {
        int full = 0, id = 0;
        boolean res = false;
        
        for (int i = 0; i < m; i++) full += 1 << i;
        tmp[full] = true;
        
        for (int i = 0; i < n; i++) {
            s[i] = 0;
            for (int j  = 0; j < m; j++) {
                s[i] += (arr[i][j] >= x) ? 1 << j : 0;
            }
            if (tmp[s[i]]) {
                res = true;
                id = i;
                break;
            }
            rec(full^s[i],0);
        }
        if (res) {
            if (id == 0) {
                l = id+1;
                r = id+1;
            }
            for (int i = 0; i < id; i++) {
                if ((s[id] | s[i]) == full) {
                    l = i+1;
                    r = id+1;
                    break;
                }
                if (i == id-1) {
                    l = id+1;
                    r = id+1;
                }
            }
        }
        
        for (int i = 0; i < full; i++) tmp[i] = false;
        return res;
    }
    
    static void rec(int x, int bit) {
        if (bit == m) {
            tmp[x] = true;
            return;
        }
        
        if ( (x&(1<<bit)) == 0 )  {
            rec(x^(1<<bit), bit+1);
        }
        rec(x, bit+1);
        
        return;
    }
    
    static class Reader {
 
    private InputStream mIs;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
 
    public Reader() {
        this(System.in);
    }
 
    public Reader(InputStream is) {
        mIs = is;
    }
 
    public int read() {
        if (numChars == -1) {
            throw new InputMismatchException();
 
    }
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = mIs.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0) {
                return -1;
            }
        }
        return buf[curChar++];
    }
 
    public String nextLine() {
        int c = read();
        while (isSpaceChar(c)) {
            c = read();
        }
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isEndOfLine(c));
        return res.toString();
    }
 
    public String next() {
        int c = read();
        while (isSpaceChar(c)) {
            c = read();
        }
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }
 
    double nextDouble()
    {
        return Double.parseDouble(next());
    }
 
    public long nextLong() {
        int c = read();
        while (isSpaceChar(c)) {
            c = read();
        }
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;
        do {
            if (c < '0' || c > '9') {
                throw new InputMismatchException();
            }
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }
 
    public int nextInt() {
        int c = read();
        while (isSpaceChar(c)) {
            c = read();
        }
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        int res = 0;
        do {
            if (c < '0' || c > '9') {
                throw new InputMismatchException();
            }
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }
 
    public boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }
 
    public boolean isEndOfLine(int c) {
        return c == '\n' || c == '\r' || c == -1;
    }
 
    }
}