View Code of Problem 5

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		int t=scanner.nextInt();
		while(t-->0) {
			int n=scanner.nextInt();
			int m=scanner.nextInt();
			int[] ans=new int[m];
			List<int[]> fruits=new ArrayList<>();
			for(int i=0;i<n;i++) {
				fruits.add(new int[] {i+1,scanner.nextInt(),scanner.nextInt()});
			}
			Collections.sort(fruits,new Comparator<int[]>(){
				public int compare(int[] o1,int[] o2) {
					if(o1[1]==o2[1]) {
						return -(o1[2]-o2[2]);
					}
					return -(o1[1]-o2[1]);
				}
			});
			for(int i=0;i<m;i++) {
				if(i==0) {
					System.out.print(fruits.get(i)[0]);
				}
				else {
					System.out.print(" "+fruits.get(i)[0]);
				}
			}
			System.out.println();
		}
	}

}