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

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 0
#endif

using i64 = long long;

#define int long long

void solve() {
    int n, k;
    cin >> n >> k;

    vector<array<int, 3>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }

    sort(a.begin(), a.end(), [](auto a, auto b) {
        if (a[2] != b[2]) {
            return a[2] > b[2];
        } else {
            return a[0] == b[1] ? a[1] < b[1] : a[0] < b[0];
        }
    });

    int ans = 0;
    int last = 0, max_last = 0;
    for (int i = 0; i < n; i++) {
        auto &[c, w, f] = a[i];

        if (last) {
            int used = min(c, (k - last) / w);
            c -= used;
            last += used * w;
        }

        if (last == k) {
            ans += max_last;
            last = max_last = 0;

        } else if (last + 1 == k) {
            for (int j = i + 1; j < n; j++) {
                auto &[cc, ww, ff] = a[j];
                if (ww == 1) {
                    cc--;
                    last++;
                    break;
                }
            }
            ans += max_last;
            last = max_last = 0;
        }

        ans += (c / (k / w)) * f;
        c %= (k / w);

        last += c * w;
        if (last > 0)
            max_last = max(max_last, f);
    }
    ans += max_last;
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}