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

using ll = long long;

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

ll n, t;
ll k;

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

bool cmp(node x, node y)
{
    if(x.f==y.f&&x.w==y.w)
        return x.c>y.c;
    if(x.f==y.f)
        return  x.w>y.w;
    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);
    ll l = 1, num = k, res = 0, r = 0, x = 0, j = 1;
    while (l <= n)
    {
        j=1;
        num = k;
        if (a[l].w == 1&&a[l].c!=0)
        {
            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;
        }

        if (num >= a[l].c * a[l].w)
        {
            num -= a[l].c * a[l].w;
            a[l].c = 0;
            res += a[l].f;
        }
        else
        {
            // tt为一次搬运第i个能搬多少
            
            ll tt = num / a[l].w;
            j = a[l].c / tt; 
            // a[i].c%tt 剩余没搬的个数
            if (a[l].c % tt == 0)
            {
                num = 0;
            }
            else
            {
                j++;
                num = num - (a[l].c % tt) * a[l].w;
            }
            a[l].c = 0;
            res += a[l].f * j;
        }

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

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

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