#include <bits/stdc++.h>

using i64 = long long;

int n;
i64 k;
struct Node {
    i64 c, w, f;
} a[100010];
bool cmp(Node a, Node b) {
    return a.f < b.f;
}

void solve() {
    std::cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        std::cin >> a[i].c >> a[i].w >> a[i].f;
    }
    std::sort(a + 1, a + n + 1, cmp);
    std::vector<int> id;
    for (int i = 1; i <= n; ++i) {
        if (a[i].w == 1) {
            id.push_back(i);
        }
    }

    i64 ans = 0;
    for (int i = n; i; i--) {
        i64 t = k / a[i].w;
        ans += a[i].f * (a[i].c / t);
        a[i].c %= t;
        if (a[i].c == 0) {
            continue;
        }
        i64 rest = k - a[i].w * a[i].c;
        ans += a[i].f, a[i].c = 0;
        for (int j = i - 1; j && rest > 1; --j) {
            i64 up = std::min(a[j].c, rest / a[j].w);
            // std::cout << up << "\n";
            rest -= up * a[j].w;
            a[j].c -= up;
        }
        // std::cout << rest << "\n";
        if (rest == 1) {
            while (!id.empty() && a[id.back()].c == 0) {
                id.pop_back();
            }
            if (!id.empty()) {
                int p = id.back();
                a[p].c -= 1;
            }
        }
    }
    std::cout << ans << "\n";
}

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

    int T; std::cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}