#include<stdio.h>
#include<stdlib.h>
struct name{
	char nick[30];
	int x;
};
int comp(const void *p, const void *q){
	return ((struct name *)q)->x-((struct name *)p)->x;
}
int main(void){
	struct name l[1001];
	int i,n,j;
	scanf("%d",&i);
	while(i--){
		scanf("%d",&n);
		for(j=0;j<n;++j){
			scanf("%s %d",l[j].nick,&l[j].x);
		}
		qsort(l,n,sizeof(struct name),comp);
		for(j=0;j<n;++j){
			printf("%s",l[j].nick);
			if(j!=n) printf("\n");
		}
	}
	return 0;
}