#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,ns[N],nh,c[N],w[N],f[N];ll k,g[N][2];
void Solve(){
	int i,j;scanf("%d%lld",&n,&k);
	nh=0;for(i=1;i<=n;i++) scanf("%d%d%d",&c[i],&w[i],&f[i]),ns[++nh]=f[i];
	sort(ns+1,ns+nh+1);nh=unique(ns+1,ns+nh+1)-ns-1;
	for(i=1;i<=nh;i++) g[i][0]=g[i][1]=0;
	for(i=1;i<=n;i++) g[LB(ns+1,ns+nh+1,f[i])-ns][w[i]-1]+=c[i];
	for(i=1;i<=nh;i++) g[i][1]+=g[i][0]/2,g[i][0]&=1;
	k/=2;ll La=0,ans=0;
	for(i=nh;i;i--){
		ll w=min(g[i][1],La);
		La-=w;g[i][1]-=w;
		if(g[i][1]){
			ans+=(g[i][1]+k-1)/k*ns[i];
			La=(k-g[i][1]%k)%k;
			g[i][1]=0;
		}
		if(g[i][0]){
			if(!La) La=k,ans+=ns[i];
			La--;
			for(int j=i-1;j;j--) if(g[j][0]){g[j][0]--;break;}
		}
	}
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}