#include<bits/stdc++.h>
#define fi first
#define se second
#define mkp make_pair
#define pii pair<int,int>
#define ll long long
using namespace std;
const int maxn=2e5+100;
int n,n1,n2;ll k;
pii p1[maxn],p2[maxn];
ll ans=0;
bool cmp(const pii &x,const pii &y) {
	return x.se>y.se;
}
int main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);	
	int T;cin>>T;
	while (T--) {
		cin>>n>>k;n1=n2=0;ans=0;
		for (int i=1;i<=n;i++) {
			int x,opt,y;cin>>x>>opt>>y;
			if (opt==1) p1[++n1]=mkp(x,y);
			else p2[++n2]=mkp(x,y);
		}
		sort(p1+1,p1+n1+1,cmp);
		sort(p2+1,p2+n2+1,cmp);
		ll lk=0;int cnt=0;
		for (int i1=1,i2=1;i1<=n1||i2<=n2;) {
			if (i1<=n1&&(i2>n2||p1[i1].se>p2[i2].se)) {
				if (p1[i1].fi==0) {
					i1++;
					continue;
				}
				if (cnt!=0) {
					int x=min(cnt,p1[i1].fi);
					cnt-=x;p1[i1].fi-=x;
					continue;
				}
				if (lk!=0) {
					ll x=min(lk,(ll)p1[i1].fi);
					lk-=x;p1[i1].fi-=x;
					continue;
				}
				if (p1[i1].fi/k) {
					ans+=1ll*p1[i1].se*(p1[i1].fi/k);
					p1[i1].fi%=k;
					continue;
				}
				ans+=p1[i1].se;
				lk=k-p1[i1].fi;
				i1++;
			} else {
				if (p2[i2].fi==0) {
					i2++;
					continue;
				}
				if (lk==1) {
					cnt++;
					lk=0;
					continue;
				}
				if (lk!=0) {
					ll x=min(lk/2,(ll)p2[i2].fi);
					lk-=x*2;p2[i2].fi-=x;
					continue;
				}
				if (p2[i2].fi*2/k) {
					ans+=1ll*p2[i2].se*(p2[i2].fi*2/k);
					p2[i2].fi%=k/2;
					continue;
				}
				ans+=p2[i2].se;
				lk=k-2*p2[i2].fi;
				i2++;
			}
		}
		cout<<ans<<endl;
	}
}
/*
2
4 6
1 1 8
7 2 5
1 1 7
3 2 6
8 1200000
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345
100000 1 100000
100000 1 12345
100000 2 100000
100000 2 12345


*/