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