View Code of Problem 5

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		String result[] =new String[t];
		for(int i=0;i<t;i++) {
			int n=in.nextInt();
			int m=in.nextInt();
			int a[][] = new int[n][3];
			for(int j=0;j<n;j++) {
				a[j][0]=in.nextInt();
				a[j][1]=in.nextInt();
				a[j][2]=j+1;
			}
			for(int j=0;j<n;j++) {
				for(int k=0;k<n-j-1;k++) {
					if(a[k][0]<a[k+1][0] || (a[k][0]==a[k+1][0] && a[k][1]<a[k+1][1])) {
						int b[] =new int [3];
						for(int l=0;l<3;l++) {
							b[l]=a[k][l];
							a[k][l]=a[k+1][l];
							a[k+1][l]=b[l];
						}
					}
				}
			}
			int j;
			result[i]="";
			for(j=0;j<m-1;j++) {
				result[i]=result[i]+a[j][2]+" ";
			}
			result[i]=result[i]+a[j][2];
		}
		for(int i=0;i<t;i++) {
			System.out.println(result[i]);
		}
		in.close();
	}

}