#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int a[1000];
struct my
{
	char name[100];
	int n;
}sz[105];
bool comp(my a,my b)
{
	return a.n>b.n;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)
			scanf("%s %d",sz[i].name,&sz[i].n);
		sort(sz+1,sz+1+n,comp);
		for(int i=1;i<=n;i++)
			printf("%s\n",sz[i].name);
	}
	return 0;
}