#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
const int N = 1e5 + 5;
// const int B = 400;
// const int M = 2e5 + 5;
// const int base = 13331;
// const int mod = 998244353;
// const int mod = 1e9 + 7;
// const double pi = acos(-1)

int n;
i64 k;
struct node
{
    int c, w, f;
    bool operator<(const node &tmp) const
    {
        return f > tmp.f;
    }
} num[N];
void solve()
{
    cin >> n >> k;
    k >>= 1;
    for (int i = 1; i <= n; i++)
        cin >> num[i].c >> num[i].w >> num[i].f;
    sort(num + 1, num + n + 1);
    i64 odd = 0;
    vector<pair<i64, i64>> tmp;
    for (int i = 1; i <= n; i++)
    {
        auto [c, w, f] = num[i];
        if (w == 2)
            tmp.push_back({f, c});
        else
        {
            if (odd)
                tmp.push_back({odd, 1}), odd = 0, c--;
            if (c >= 2)
                tmp.push_back({f, c / 2});
            if (c & 1)
                odd = f;
        }
    }
    if (odd)
        tmp.push_back({odd, 1});
    sort(tmp.begin(), tmp.end(), greater<>());
    i64 ans = 0;
    for (int i = 0; i < tmp.size();)
    {
        if (tmp[i].second >= k)
        {
            i64 times = tmp[i].second / k;
            tmp[i].second %= k;
            ans += times * tmp[i].first;
        }
        if (tmp[i].second == 0)
        {
            i++;
            continue;
        }
        int j = i;
        i64 remain = k;
        while (j < tmp.size())
        {
            i64 u = min(remain, tmp[j].second);
            remain -= u, tmp[j].second -= u;
            if (tmp[j].second == 0)
                j++;
            else
                break;
        }
        ans += tmp[i].first;
        i = j;
    }
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    // cout << fixed << setprecision(10);
    while (t--)
        solve();
}