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