#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <random>
#include <cassert>
#include <array>

using namespace std;
using ll = long long;

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define int ll

void solve() {
    int n, k; cin >> n >> k;
    vector<array<int, 3>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i][1] >> a[i][2] >> a[i][0];
    }
    sort(all(a));
    int ans = 0;
    int i = n - 1;
    while (i >= 0) {
        if (a[i][1] * a[i][2] >= k) {
            int mcnt_one = k / a[i][2];
            int pick = a[i][1] / mcnt_one;;
            ans += a[i][0] * pick;
            a[i][1] -= mcnt_one * pick;
        } else {
            int cs = a[i][1] * a[i][2];
            a[i][1] = 0;
            int j = i - 1;
            while (j >= 0 && cs + a[j][2] <= k) {
                int canpick = min(a[j][1], (k - cs) / a[j][2]);
                a[j][1] -= canpick;
                cs += canpick * a[j][2];
                j--;
            }
            ans += a[i][0];
        }
        while (i >= 0 && a[i][1] == 0) i--;
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; ++t) {
        solve();
    }
}