#include<iostream>
#include<string>
#include<algorithm>
#include<vector>

#define MAXN 100
using namespace std;

int C;
int N, W;
string name[MAXN];
int cap[MAXN];
int need[MAXN];
int memo[MAXN][1001];
vector<string> list;

int setmemo(int id, int weight){
    int& ret = memo[id][weight];
    if (ret != -1) return ret;
    //기저사례: id가 끝까지 도달
    if (id == N) return 0;
    ret = max(ret, setmemo(id + 1, weight));
    if (weight >= cap[id])
        ret = max(ret, setmemo(id + 1, weight - cap[id]) + need[id]);
    return ret;
}

void reconstruct(int id, int weight){
    if (id == N) return;
    //리스트에 없음
    if (setmemo(id, weight) == setmemo(id + 1, weight))
    {
        reconstruct(id + 1, weight);
    }
    //리스트에 있음
    else
    {
        list.push_back(name[id]);
        reconstruct(id + 1, weight - cap[id]);
    }
}

void solve()
{

    //1. 리스트 생성
    reconstruct(0, W);

    //2. 리스트 출력
    cout << setmemo(0, W) << " " << list.size() << endl;
    if (list.size() == 0) return;
    for (int i = 0; i < list.size() - 1; i++)
    {
        cout << list[i] << endl;
    }
    cout << *list.rbegin();
}

int main()
{
    cin >> C;
    while (C--)
    {
        //메모 초기화
        for (int i = 0; i < MAXN; i++)
        {
            for (int j = 0; j < 1001; j++)
            {
                memo[i][j] = -1;
            }
        }
        list.clear();
        cin >> N >> W;
        for (int i = 0; i < N; i++)
        {
            cin >> name[i] >> cap[i] >> need[i];
        }
        solve();
        if (C != 0) cout << endl;
    }
    return 0;
}