#include <cstdio>
#include <iostream>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int n,m,i,j,k;
int f[114];
map<int,int>ff;
struct node{
	char s[1919];
	int k;
}kk[114];
bool cmp(const node &a,const node &b){
	return a.k>b.k;
}
int main()
{
	int t;
	cin>>t;
	while(t--){
		cin>>n;
		for(i=0;i<n;++i)
		{
			scanf("%s %d",kk[i].s,&kk[i].k);
		}
		sort(kk,kk+n,cmp);
		for(i=0;i<n;++i)
			cout<<kk[i].s<<endl;
	}
	return 0;
}