#include <stdio.h>
int n, w;
char things[101][22];
char chosen[101][22];
int weight[101], wish[101];
int opt[101][1001], chidx;
int calc(int idx, int wgt) {
    if (idx == n || wgt > w) return 0;
    if (wgt + weight[idx] > w) return opt[idx][wgt] = calc(idx + 1, wgt);
    if (opt[idx][wgt] != -1) return opt[idx][wgt];
    int c1 = calc(idx + 1, wgt + weight[idx]) + wish[idx],
        c2 = calc(idx + 1, wgt);
    return opt[idx][wgt] = (c1 > c2 ? c1 : c2);
}
void footprint(int st, int w) {
    if (opt[st][w] <=0 || st == n) return;
    if (opt[st + 1][w] == opt[st][w]) 
        footprint(st + 1, w);
    else if (opt[st + 1][w + weight[st]] == (opt[st][w] - wish[st]))
    {
        sprintf(chosen[chidx++], "%s", things[st]);
        footprint(st + 1, w + weight[st]);
    }
}
int main() {
    int c; scanf("%d", &c);
    while (c--) {
        scanf("%d %d", &n, &w); chidx = 0;
        for (int i = 0; i < n; i++) {
            scanf("%s %d %d", things[i], &weight[i], &wish[i]);
            for (int j = 0; j <= w; j++) opt[i][j] = -1;
        }
        printf("%d ", calc(0, 0)); footprint(0, 0);
        printf("%d\n", chidx);
        for (int i = 0; i < chidx; i++) {
            printf("%s\n", chosen[i]);
        }
    }
}