#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
using namespace std;
int b,c,t,m,n,flag;
const int maxn=110;
struct student{
	char a[22];
	int num;
}node[maxn];
bool cmp(student a,student b){
	return a.num>b.num;
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		getchar();
		for(int i=0;i<n;i++){
			scanf("%s",node[i].a);
			scanf("%d",&node[i].num);
			getchar();
		}
		sort(node,node+n,cmp);
		for(int i=0;i<n;i++){
			puts(node[i].a);
		}
	}
	return 0;
}