#include <bits/stdc++.h>
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second

using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int N = 3e5 + 50;
const ll mod = 998244353;
//__builtin_ctzll(x);后导0的个数
//__builtin_popcount计算二进制中1的个数
struct node {
    int c, w, f;
};

bool cmp(node a, node b) {
    if (a.f == b.f) return a.w > b.w;
    return a.f > b.f;
}

void work() {
    int n, k; cin >> n >> k;
    vector<node> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        int c, w, f; cin >> c >> w >> f;
        a[i] = {c, w, f};
    }
    sort(a.begin() + 1, a.end(), cmp);
    ll ans = 0;
    int res = 0, nw = 0;
    int l = 0;
    for (int i = 1; i <= n; ++i) {
        if (nw + a[i].c * a[i].w <= k) {
            nw += a[i].c * a[i].w;
            a[i].c = 0;
            res = max(res, a[i].f);
        } else {
            int x = (k - nw) / a[i].w;
            a[i].c -= x;
            nw += x * a[i].w;
            res = max(res, a[i].f);
            if (a[i].c) i--;
        }

        if (nw == k - 1) {
            l = max(l, i + 1);
            while (l <= n && a[l].w != 1) l++;
            if (l <= n) {
                if (a[l].c) {
                    a[l].c--; nw++;
                    res = max(res, a[l].f);
                }
                if (a[l].c == 0) l++;
            }
        }
        if (nw >= k - 1) {
            ans += res; nw = 0;res = 0;
        }
    }
    if (res) ans += res, res = 0;
    cout << ans << '\n';
}

signed main() {
    io;
    int t = 1;
    cin >> t;
    while (t--) {
        work();
    }
    return 0;
}