Link:
import java.util.Scanner;
class Codechef
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int arr1[]=new int[n];
int arr2[]=new int[m];
for(int i=0;i<n;i++)
{
arr1[i]=sc.nextInt();
}
for(int i=0;i<m;i++)
{
arr2[i]=sc.nextInt();
}
int max=Integer.MIN_VALUE;
int index1=-1;
for(int i=0;i<n;i++)
{
if(arr1[i]>max)
{
max=arr1[i];
index1=i;
}
}
int min=Integer.MAX_VALUE;
int index2=-1;
for(int i=0;i<m;i++)
{
if(arr2[i]<min)
{
min=arr2[i];
index2=i;
}
}
for(int i=0;i<m;i++)
{
System.out.println(index1+" "+i);
}
for(int i=0;i<n;i++)
{
if(i==index1)
continue;
System.out.println(i+" "+index2);
}
}
}
//The constraints are of order 10^5 and I have written a O(n) loop so it should execute