#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OPFI(x) freopen(#x".in", "r", stdin);\
                freopen(#x".out", "w", stdout)
#define REP(i, a, b) for(int i=(a); i<=(b); ++i)
#define REPd(i, a, b) for(int i=(a); i>=(b); --i)
inline ll rd(){
    ll r=0, k=1; char c; while(!isdigit(c=getchar())) if(c=='-') k=-k;
    while(isdigit(c)) r=r*10+c-'0', c=getchar(); return r*k;
}
constexpr int N=1e5+10;
ll t, n, k, ans;
struct node{
    ll a, b;
}d[N];
int main(){
    t=rd();
    while(t--){
        n=rd(), k=rd(), ans=0;
        REP(i, 1, n){
            ll x=rd(), y=rd();
            d[i].a=x*y, d[i].b=rd(); 
        }
        sort(d+1, d+n+1, [](const node& x, const node& y){ return x.b>y.b; });
        ll last=k;
        REP(i, 1, n){
            if(k-last>d[i].a){
                last+=d[i].a;
                continue;
            }
            ll tmp=d[i].a;
            tmp-=(k-last);
            ans+=(tmp/k)*d[i].b;
            if(tmp%k) ans+=d[i].b, last=tmp%k;
            else last=k;
        }
        printf("%lld\n", ans);
    }
    return 0;
}