#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 1e5+5;
ll f[3][MAXN];
int main()
{
    int t;
    cin>>t;
    while(t--){
        ll n,k;
        cin>>n>>k;
        k/=2;
        vector<int>crd;
        for(int i=0;i<n;i++){
            int c,w,f0;
            cin>>c>>w>>f0;
            f[w][f0]+=c;
            crd.pb(f0);
        }
        sort(all(crd));
        crd.resize(unique(all(crd)) - crd.begin());
        vector<int>ones;
        for(int i=0;i<sz(crd);i++){
            if(f[1][crd[i]]&1)ones.pb(i);
            //cout<<crd[i]<<" ";
        }
        //cout<<'\n';
        ll ans = 0;
        ll carry = 0;
        for(int i=sz(crd)-1;i>=0;i--){
            ll need = f[2][crd[i]] + f[1][crd[i]]/2;
            //cout<<need<<" "<<carry<<'\n';
            ll tmp = min(need,carry);
            carry -= tmp;
            need -= tmp;

            ll cnt = (need/k);
            ans += cnt * 1LL * crd[i];
            need -= cnt * k;
            if(need){
                ans+=crd[i];
                carry+= k-need;
            }

            if(f[1][crd[i]] & 1){
                if(carry){
                    carry--;
                     if(!ones.empty()){
                        int v = ones.back();
                        ones.pop_back();
                        f[1][crd[v]]--;
                    }
                }else{
                    ans += crd[i];
                    carry = k-1;
                    ones.pop_back();
                    if(!ones.empty()){
                        int v = ones.back();
                        ones.pop_back();
                        f[1][crd[v]]--;
                    }
                }
            }
        }
        cout<<ans<<'\n';
        for(int x:crd)f[1][x] = f[2][x] = 0;
    }

}