#include <bits/stdc++.h>
#define endl '\n' 
using namespace std;
using ll = long long;
typedef pair<ll, ll> PII;
const ll N = 1e5 + 5;
const ll INF = 1e18;

typedef struct PARCELS {
    ll c, w, f;
    bool operator<(const PARCELS& other) const {
        return (f == other.f ? c * w < other.c * other.w : f > other.f);
    }
}parcels;

parcels a[N];
ll pre[N];
ll n, k;

void solve() {
    cin >> n >> k;
    for (ll i = 1; i <= n; i++)
        cin >> a[i].c >> a[i].w >> a[i].f;
    sort(a + 1, a + 1 + n);
    for (ll i = 1; i <= n; i++) {
        pre[i] = pre[i - 1] + (a[i].c * a[i].w);
        // printf("%d: %d %d %d %d\n", i, a[i].c, a[i].w, a[i].f, pre[i]);
    }
    ll p = 0, ans = 0;
    for (ll i = 1; i <= n; i++){
        // if (pre[i] <= p * k) continue;
        ll l = 1, r = (pre[n] + k - 1) / k;
        while(l <= r){
            ll mid = (l + r) >> 1;
            if (mid * k >= pre[i]) r = mid - 1;
            else l = mid + 1;
        }
        // cout << pre[i] << ": " << l * k << ' ' << r * k << endl;
        // cout << i << ": " << l << ' ' << p  << endl;
        ans += (l - p) * a[i].f;
        p = l;
    }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    ll t; cin >> t;
    while (t--) solve();
}