#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
inline int in(){
    int x;
    scanf("%lld",&x);
    return x;
}
const int N=1e5+5;
int n;
ll k;
struct node{
    int c,w,f;
}a[N];
void solve(){
    n=in();scanf("%lld",&k);
    for(int i=1;i<=n;i++)
        a[i].c=in(),a[i].w=in(),a[i].f=in();
    sort(a+1,a+n+1,[](node a,node b){
        if(a.f!=b.f)return a.f>b.f;
        return a.w>b.w;
    });
    int cnt=0;
    ll ans=0,now=k;
    for(int i=1;i<=n;i++){
        if(a[i].w==1){
            if(a[i].c<=cnt){
                cnt-=a[i].c;
                continue;
            }
            a[i].c-=cnt,cnt=0;
        }
        if(now+a[i].c*a[i].w<=k){
            if(now==0)ans+=a[i].f;
            now+=a[i].w*a[i].c;
            continue;
        }
        int cur=(k-now)/a[i].w;
        now+=cur*a[i].w;
        if(now<k)cnt++;
        now=0,a[i].c-=cur;
        ans+=1ll*(a[i].c*a[i].w/k)*a[i].f;
        a[i].c%=(k/a[i].w);
        if(a[i].c>0)ans+=a[i].f,now=a[i].c*a[i].w;
    }
    printf("%lld\n",ans);
}
signed main(){
    int T=in();
    while(T--)solve();
    return 0;
}