#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <complex>

using namespace std;

void solve() {
    int n;
    long long k;
    cin >> n >> k;
    vector <pair <long long, long long>> w1, w2;
    for (int i = 0; i < n; i++) {
        long long c, w, f;
        cin >> c >> w >> f;
        if (w == 1) {
            w1.push_back({f, c});
        }
        if (w == 2) {
            w2.push_back({f, c});
        }
    }
    sort(w1.begin(), w1.end());
    sort(w2.begin(), w2.end());
    long long ans = 0;
    while (!w1.empty() || !w2.empty()) {
        long long curr = 0;
        long long left = k, nr = 0;
        if (!w1.empty()) {
            curr = max(curr, w1.back().first);
        }
        if (!w2.empty()) {
            curr = max(curr, w2.back().first);
        }
        if (!w1.empty() && curr == w1.back().first) {
            nr = (w1.back().second + k - 1) / k;
            left = k - w1.back().second % k;
            w1.pop_back();
        }
        else {
            nr = (2 * w2.back().second + k - 1) / k;
            left = k - (2 * w2.back().second) % k;
            w2.pop_back();
        }
        if (left == k) {
            left = 0;
        }
        ans += nr * curr;
        while (left > 0 && (!w1.empty() || !w2.empty())) {
            if (left == 1 && w1.empty()) {
                break;
            }
            if (w2.empty()) {
                long long take = min(left, w1.back().second);
                left -= take;
                if (take == w1.back().second) {
                    w1.pop_back();
                }
                else {
                    w1[w1.size() - 1].second -= take;
                }
                continue;
            }
            if (w1.empty()) {
                long long take = min(left / 2, w2.back().second);
                left -= 2 * take;
                if (take == w2.back().second) {
                    w2.pop_back();
                }
                else {
                    w2[w2.size() - 1].second -= take;
                }
                continue;
            }
            if (left == 1) {
                long long take = min(left, w1.back().second);
                left -= take;
                if (take == w1.back().second) {
                    w1.pop_back();
                }
                else {
                    w1[w1.size() - 1].second -= take;
                }
                continue;
            }
            if ((w1.back().first >= w2.back().first)) {
                long long take = min(left, w1.back().second);
                left -= take;
                if (take == w1.back().second) {
                    w1.pop_back();
                }
                else {
                    w1[w1.size() - 1].second -= take;
                }
                continue;
            }
            else {
                long long take = min(left / 2, w2.back().second);
                left -= 2 * take;
                if (take == w2.back().second) {
                    w2.pop_back();
                }
                else {
                    w2[w2.size() - 1].second -= take;
                }
            }
        }
    }
    cout << ans << '\n';
}

int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nrTeste;
    cin >> nrTeste;
    while (nrTeste--) {
        solve();
    }
    return 0;
}