#include<bits/stdc++.h>
using namespace std;

const int maxn = (1<<15) + 10;

int dp[maxn];
int path[maxn];
int decline[20];
int cost[20];
int tme[maxn];
int n;
char s[20][105];

void print(int num)
{
    if(!num)
        return;
    print(num-(1<<path[num]));
    printf("%s\n",s[path[num]]);
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 0; i < n; i++)
        {
            scanf("%s%d%d", s[i], &decline[i], &cost[i]);
        }
        dp[0] = 0;
        memset(path,0,sizeof(path));
        for(int i = 1; i < (1<<n); i++)
        {
            dp[i]=1e9;
            for(int j = n-1; j >= 0; j--)
            {
                int temp = (1<<j);
                if(!(temp & (i)))
                    continue;
                int ans = tme[i^temp]+cost[j]-decline[j];
                if(ans<0)
                    ans = 0;
                if(dp[i] > dp[i^temp]+ans)
                {
                    dp[i] = dp[i^temp]+ans;
                    tme[i]=tme[i^temp]+cost[j];
                    path[i]=j;
                }
            }
        }
        printf("%d\n", dp[(1<<n)-1]);
        print((1<<n)-1);
    }
}