#include <bits/stdc++.h>
#define int long long
#define ite map<int, int, greater<int>>::iterator
using namespace std;

struct node {
    int c, w, f;
};
void solve() {
    int n, k;
    cin >> n >> k;
    map<int, int, greater<int>> mp[3];
    for (int i = 0; i < n; i++) {
        int c, w, f;
        cin >> c >> w >> f;
        if (w == 1) {
            mp[1][f] += c;
        } else
            mp[2][f] += c;
    }
    int ans = 0, last = k, nowf = 0;
    for (ite it1 = mp[1].begin(), it2 = mp[2].begin();
         it1 != mp[1].end() || it2 != mp[2].end();) {
        // cerr<<ans<<' '<<last<<' '<<nowf<<'\n';
        // cerr << (*it1).first << ' ' << (*it2).first << '\n';
        if (it1 == mp[1].end() ||
            (it2 != mp[2].end() && (*it2).first >= (*it1).first)) {
            if ((*it2).second * 2 < last) {
                nowf = max(nowf, (*it2).first), last -= (*it2).second * 2;
            } else if ((*it2).second * 2 == last) {
                ans += max(nowf, (*it2).first), nowf = 0, last = k;
            } else {
                if (last & 1) {
                    if (it1 != mp[1].end()) {
                        (*it1).second--, last--;
                        if ((*it1).second == 0) {
                            it1++;
                        }
                    }
                }
                (*it2).second -= last / 2, ans += max(nowf, (*it2).first),
                    last = k, nowf = (*it2).first;
                ans += (*it2).second / (last / 2) * nowf;
                (*it2).second %= (last / 2);
                if ((*it2).second == 0) {
                    nowf = 0;
                } else {
                    last -= (*it2).second * 2;
                }
            }
            it2++;

        } else {
            if ((*it1).second < last) {
                nowf = max(nowf, (*it1).first), last -= (*it1).second;
            } else if ((*it1).second == last) {
                ans += max(nowf, (*it1).first), nowf = 0, last = k;
            } else {
                (*it1).second -= last, ans += max(nowf, (*it1).first),
                    last = k, nowf = (*it1).first;
                ans += (*it1).second / last * nowf;
                (*it1).second %= last;
                if ((*it1).second == 0) {
                    nowf = 0;
                } else {
                    last -= (*it1).second;
                }
            }
            it1++;
        }
    }
    if (last != k) {
        ans += nowf;
    }
    cout << ans << '\n';
    return;
}
signed main() {
    // ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}