#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int FibonacciNum(int n){  
    if(n < 0){  
        return -1;  
    }  
    if(n == 0){  
        return 0;  
    }else if(n == 1){  
        return 1;  
    }else {  
        return(FibonacciNum(n-1) + FibonacciNum(n-2));  
    }  
}  
  
struct student{
	char name[30];
	int a,b,c;
};
int comp(const void*p,const void*q){
	return ((struct student *)q)->c-((struct student *)p)->c;
}
int main(){
	struct student aa[105];
	int i,j,k,t,n,m=0;
	if(m==0){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(i=0;i<n;i++){
		scanf("%s%d%d",aa[i].name,&aa[i].a,&aa[i].b);
		aa[i].c=aa[i].a+aa[i].b;
		}
		qsort(aa,n,sizeof(struct student),comp);
		for(i=0;i<n;i++){
		printf("%s\n",aa[i].name);
		}
	}
	}
	return 0;
}