#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
vector<string> names,results;
int volumes[101], desire[101], choices[101];
int cache[101][1001];
int n,w, counts=0;
int desireSum(int index, int v, int count){
    if(index>=n) return 0;
    int& ret = cache[index][v];
    if(ret != -1) return ret;
    ret = desireSum(index+1, v, count);
    if(v+volumes[index] <= w){
        int cand = desireSum(index+1,v+volumes[index],count+1)+desire[index];
        if(ret < cand){
            choices[count] = index+1;
            ret = cand;
        }
    }
    return ret;
}
int main(){
    int c;
    scanf("%d", &c);
    while(c--){
        memset(volumes, 0, sizeof(volumes));
        memset(desire, 0, sizeof(desire));
        memset(cache, -1, sizeof(cache));
        memset(choices, 0, sizeof(choices));
        names = vector<string>();
        results = vector<string>();
        counts = 0;
        scanf("%d %d", &n, &w);
        string name;
        for(int i=0;i<n;++i) {
            cin >> name;
            scanf("%d %d", &volumes[i], &desire[i]);
            names.push_back(name);
        }
        int result = desireSum(0,0,0);
        for(int i=0;i<n;++i) if(choices[i]) counts++;
        printf("%d %d\n", result, counts);
        for(int i=0;i<n;++i) if(choices[i]) printf("%s\n", names[choices[i]-1].c_str());
    }
    return 0;
}