#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

struct P{
    int c;
    int w;
    int f;
};

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    std::cin >> t;
    while(t--){
        int n;
        ll k;
        std::cin >> n >> k;
        std::vector<P> a(n);
        fore(i, 0, n){
            int c, w, f;
            std::cin >> c >> w >> f;
            a[i] = {c, w, f};
        }

        std::sort(ALL(a), [](const P& l, const P& r){
            return l.f > r.f;
        });


        ll ans = 0;
        int i = 0;
        while(i < n){
            if(!a[i].c){
                ++i;
                continue;
            }
            auto [c, w, f] = a[i];
            ll x = k / w;
            if(c >= x){
                ll y = c / x;
                ans += y * f;
                a[i].c -= y * x;
                continue;
            }
            ll sw = 0;
            int j = i;
            while(j < n){
                auto [c, w, f] = a[j];
                ll m = std::min((ll)c, (k - sw) / w);
                sw += m * w;
                a[j].c -= m;
                if(sw == k) break;
                ++j;
            }
            ans += a[i].f;
        }

        std::cout << ans << endl;
    }
    
    return 0;
}