#include <stdio.h>

 #include <algorithm>

 #include <string.h>

 #include <string>

 #include <iostream>

 #include <stack>

 using namespace std;

 const int inf = 0x3f3f3f3f;

 struct node

 {

     string name;

     int cost,deadline;

 }a[];

 struct state

 {

     int pre,now;

     int t,score;

 }dp[<<];

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

         int n;

         scanf("%d",&n);

         for(int i=;i<n;i++) cin >> a[i].name >> a[i].deadline >> a[i].cost;

         int all =  << n;

         for(int mask=;mask<all;mask++)

         {

             dp[mask].score = inf;

             for(int i=n-;i>=;i--)

             {

                 if(mask & (<<i))

                 {

                     int pre = mask - (<<i);

                     int add = dp[pre].t + a[i].cost - a[i].deadline;

                     if(add < ) add = ;

                     if(dp[pre].score + add < dp[mask].score)

                     {

                         dp[mask].score = dp[pre].score + add;

                         dp[mask].pre = pre;

                         dp[mask].now = i;

                         dp[mask].t = dp[pre].t + a[i].cost;

                     }

                 }

             }

         }

         int temp = all - ;

         printf("%d\n",dp[temp].score);

         stack<int> S;

         while(temp)

         {

             S.push(dp[temp].now);

             temp = dp[temp].pre;

         }

         while(!S.empty())

         {

             int x = S.top(); S.pop();

             cout << a[x].name << endl;

         }

     }

     return ;

 }