#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define debug(x) cout<<#x<<": "<<x<<endl
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll=long long;
using ull=unsigned long long;
#define int long long
struct node
{
    int c,w,f;
    bool operator<(const node&t)const{
        return f>t.f;
    }
};
void solve(){
    int n,k;
    cin>>n>>k;
    vector<node> a(n);
    for(int i=0;i<n;i++)
        cin>>a[i].c>>a[i].w>>a[i].f;
    sort(a.begin(),a.end());
    vector<int> st;
    for(int i=0;i<n;i++){
        if(a[i].w==1)
            st.push_back(i);
    }
    reverse(st.begin(),st.end());
    int ans=0,cm=0;
    int cur=0;
    for(int i=0;i<n;i++){
        if(!st.empty()&&i==st.back())
            st.pop_back();
        cm=max(cm,a[i].f);
        if(cur+a[i].w*a[i].c<k){
            cur+=a[i].w*a[i].c;
        }
        else if(cur+a[i].w*a[i].c==k){
            ans+=cm;
            cur=0;
            cm=0;
        }
        else{
            int lf=k-cur;
            if(lf%a[i].w){
                if(!st.empty()){
                    int del=st.back();
                    a[del].c--;
                    if(a[del].c==0){
                        st.pop_back();
                    }
                }
                ans+=cm;
                cm=a[i].f;
                a[i].c-=lf/a[i].w;
            }
            else{
                ans+=cm;
                cm=a[i].f;
                a[i].c-=lf/a[i].w;
            }
            cur=0;
            if(a[i].c*a[i].w>=k){
                int tran=(a[i].c*a[i].w)/k;
                int pre=k/a[i].w;
                ans+=a[i].f*tran;
                a[i].c-=tran*pre;
            }
            i--;
        }
    }
    if(cur){
        ans+=cm;
    }
    cout<<ans<<endl;
}
signed main(){
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}
/*
贡献法
正难则反
数小状压
*/