#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<iomanip>
using namespace std;
typedef long long ll;
struct PART{
	char name[21];
	int s1,s2;
	int tot;
}a[101];
int main()
{
	int t,n;
	
	cin>>t;
	while(t--)
	{
		scanf("%d",&n);
		for(int i = 0 ; i < n ; i++)
		{
			scanf("%s%d%d",a[i].name,&a[i].s1,&a[i].s2);
			a[i].tot = a[i].s1 + a[i].s2;
		}
		for(int i = 0 ; i < n ; i++)
			for(int j = n-1 ; j > i ; j--)
				if(a[i].tot < a[j].tot)
				{
					PART temp = a[i];
					a[i] = a[j];
					a[j] = temp;
				}
				for(int i = 0 ; i < n ; i++)
					printf("%s\n",a[i].name);
	}
}