#include <bits/stdc++.h>

using ll = long long;

void solve() {
    int n;
    ll k;
    std::cin >> n >> k;

    std::vector<int> c(n), w(n), f(n);
    for (int i = 0; i < n; ++ i) {
        std::cin >> c[i] >> w[i] >> f[i];
    }

    ll ans = 0;
    std::vector<int> id(n);
    std::iota(id.begin(), id.end(), 0);

    std::sort(id.begin(), id.end(), [&](int i, int j) {
        if (f[i] != f[j]) {
            return f[i] > f[j];
        }
        return w[i] > w[j];
    });

    for (int i = 0; i < n; ++ i) {
        int j = i, u = id[i], maxf = f[u];
        ll cost = 0;
        if (c[u] == 0) {
            continue;
        }

        if (1LL * c[u] * w[u] > k) {
            ll t = (1LL * c[u] * w[u]) / k;
            ans += maxf * t;
            ll x = k / w[u];
            c[u] -= x * t;
            i = i - 1;
            continue;
        }

        while (j < n) {
            int v = id[j];
            if (cost + 1LL * c[v] * w[v] <= k) {
                cost += 1LL * c[v] * w[v];
                j ++;
            }
            else {
                ll cnt = (k - cost) / w[v];
                c[v] -= cnt;
                break;
            }
        }
        ans += maxf;
        i = j - 1;
    }

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);

    int T;
    std::cin >> T;

    while (T --) {
        solve();
    }

    return 0;
}