#include<iostream>
#include<cstring>
#include<vector>
#include<array>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n; LL k;
        cin >> n >> k;
        vector<array<int, 3> > p(n);
        for(int i = 0; i < n; i++){
            for(auto &x : p[i]){
                cin >> x;
            }
        }
        sort(p.begin(), p.end(), [&](array<int, 3> a, array<int, 3> b){
            return a[2] > b[2];
        });
        int pos1 = 0;
        while(pos1 < n && !(p[pos1][1] == 1 && p[pos1][0] > 0)) pos1++;
        LL t = 0, ans = 0; int cur = 0;
        for(auto &[c, w, f] : p){
            if (c == 0) continue;
            LL add = min(1LL * c, (k - t) / w);
            c -= add;
            t += add * w;
            cur = max(cur, f);
            if (t + 1 == k){
                while(pos1 < n && !(p[pos1][1] == 1 && p[pos1][0] > 0)) pos1++;
                if (pos1 != n){
                    p[pos1][0] -= 1;
                    t += 1;
                }
            }
            if (t + 1 >= k){
                ans += cur;
                t = 0; cur = 0;
            }
            if (c > 0){
                ans += 1LL * f * (c / (k / w));
                c %= k / w;
                if (c > 0){
                    t = c * w;
                    cur = f;
                    c = 0;
                    if (t + 1 == k){
                        while(pos1 < n && !(p[pos1][1] == 1 && p[pos1][0] > 0)) pos1++;
                        if (pos1 != n){
                            p[pos1][0] -= 1;
                            t += 1;
                        }
                    }
                    if (t + 1 >= k){
                        ans += cur;
                        t = 0; cur = 0;
                    }
                }
            }
        }
        ans += cur;
        cout << ans << '\n';
    }

}