#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<cmath> 
using namespace std;
struct node
{
	char b[102][22];
	int m;
}a[102];
bool cmp(node x,node y)
{
	return x.m>y.m;
}
int main()
{
	int t;
	int n;
	int i;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%s %d",a[i].b,&a[i].m);
		}
		sort(a,a+n,cmp);
		for(i=0;i<n;i++)
		{
			printf("%s\n",a[i].b);
		}
	}
}