#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;

short cache[100][1000];
vector<short> volume;
vector<short> importance;
short solve(int from, int limit){
    short& ret = cache[from][limit];

    if ((from == volume.size() - 1) && volume[from] <= limit) return ret = importance[from];
    if ((from == volume.size() - 1) && volume[from] > limit) return ret = 0;

    short minimum = volume[from];
    for (int i = from + 1; i < volume.size(); ++i)
        minimum = min(minimum, volume[i]);
    if (minimum > limit) return ret = 0;

    if (ret != -1) return ret;
    if (volume[from]<=limit)
        ret = importance[from] + solve(from + 1, limit - volume[from]);
    ret = max(ret, solve(from + 1, limit));


    return ret;


}



int main(){
    int cases; cin >> cases;
    while (cases--){
        int numOfItems, volumeOfCarrier;
        cin >> numOfItems >> volumeOfCarrier;
        vector<string> items(numOfItems);
        volume.resize(numOfItems);
        importance.resize(numOfItems);
        int count = 0;
        while (numOfItems--){
            cin >> items[count] >> volume[count] >> importance[count];
            count++;
        }
        memset(cache, -1, sizeof(cache));
        //itemsIndex.clear();
        cout << solve(0, volumeOfCarrier);
        vector<int> itemsIndex;
        int volumeLimit = volumeOfCarrier;

        if (items.size() == 1 && volume[0] <= volumeOfCarrier) cout << ' ' << 1 << endl << items[0] << endl;
        else if (*min_element(volume.begin(), volume.end()) > volumeOfCarrier) cout << ' ' << 0 << endl;
        else{
            for (int i = 0; i < items.size() - 1; ++i){
                if (cache[i][volumeLimit] >cache[i + 1][volumeLimit]){
                    itemsIndex.push_back(i); volumeLimit -= volume[i];
                }
            }
            if (cache[items.size() - 1][volumeLimit] == importance[items.size() - 1]) itemsIndex.push_back(items.size() - 1);
            cout << ' ' << itemsIndex.size() << endl;
            for (int i = 0; i < itemsIndex.size(); ++i)
                cout << items[itemsIndex[i]] << endl;
        }


    }

}