#include<stdio.h>
#include<stdlib.h> 
struct Student{
	char name[31];
	int score1;
	int score2;
	int total;
};
int p(int *a,int *b){
	return *(int *)b-*(int *)a;
}
int main(void){
	int t,n;
	struct Student m;
	struct Student student[101];
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%s %d %d",student[i].name,&student[i].score1,&student[i].score2);
			student[i].total=student[i].score1+student[i].score2;
		}
		//qsort(student.total,n,sizeof(student[0].total),p);
		for(int i=0;i<n-1;i++){
			for(int j=0;j<n-i-1;j++){
				if(student[j].total<student[j+1].total){
					m=student[j+1];
					student[j+1]=student[j];
					student[j]=m;
				}
			}
		}
		for(int i=0;i<n;i++)
		printf("%s\n",student[i].name);
	}
}