#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

#define NN 100010

int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    G(t) while(t--) {
        G(n) G(k)
        priority_queue<pl> ones;
        priority_queue<pl> twos;

        ll cost = 0;

        while (n--) {
            G(c) G(w) G(f)
            (w == 1 ? ones : twos ).emplace(f, c);
        } 

        while (ones.size()) {
            auto [f, cnt] = ones.top(); ones.pop();
            if (cnt >= 2) {
                ll num = cnt/2;
                twos.emplace(f, num);
                cnt -= num * 2;
            }
            if (cnt) {
                if (ones.size()) {
                    auto [f2, cnt2] = ones.top(); ones.pop();
                    cnt2--;
                    twos.emplace(f, 1);
                    if (cnt2) ones.emplace(f2, cnt2);
                } else twos.emplace(f, 1);
            }
        }
        k/=2;

        while (twos.size()) {
            if (twos.top().V < k) {
                ll current = k;
                cost += twos.top().K;
                while (twos.size() and current) {
                    auto [f, cnt] = twos.top(); twos.pop();
                    ll sub = min(current, cnt);
                    cnt -= sub; current -= sub;
                    if (cnt) twos.emplace(f, cnt);
                }
            } else {
                auto [f, cnt] = twos.top(); twos.pop();
                cost += cnt/k * f;
                cnt %= k;
                if (cnt) twos.emplace(f, cnt);
            }
        }

        cout << cost << '\n';
    }
}