#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int N = 1e5 + 10 + 10;
const int INF = 0x3f3f3f3f;

int n, t, m;
ll k;

struct node
{
    int c, w, f;
    
} a[N];

bool cmp(node x,node y)
{
    return x.f>y.f;
}

void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].c >> a[i].w >> a[i].f;
    }
    sort(a + 1, a + 1 + n,cmp );
    int l = 1, num = k, res = 0, r = 0, x = 0;
    while (l <= n)
    {
        num = k;
        r = 0;
        if (a[l].w == 1)
        {
            if(a[l].c>=x)
            {
                a[l].c-=x;
                x=0;;
            }
            else
            {
                x-=a[l].c;
                a[l].c=0;
            }
        }

        if(a[l].c==0)
        {
            l++;
            continue;
        }

        for (int i = l; i <= n; i++)
        {
            if (num <= 1)
            {
                x += num;
                break;
            }
            if (num >= a[i].c * a[i].w)
            {
                num -= a[i].c * a[i].w;
                a[i].c=0;
                r = max(r, a[i].f);
            }
            else
            {
                int tt = num / a[i].w;
                a[i].c-=tt;
                num -= tt * a[i].c;
                r = max(r, a[i].f);
            }
        }
        res += r;
        //cout<<r<<endl;
    }
    cout<<res<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}