#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 300000
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int c,w,v;
	bool operator < (const reads &t)const
	{
		return v<t.v;	
	}
};
reads st[N+1];
int T,n;
long long k,res,rst,ans;
int main()
{
	bool op;
	T=read();
	while (T--)
	{
		n=read(),k=read(),res=ans=rst=0;
		for (int i=1;i<=n;++i)
		{
			st[i].c=read(),st[i].w=read(),st[i].v=read();
			if (st[i].w==2) st[i].c*=2;
		}
		sort(st+1,st+n+1);
		for (int i=1;i<=n;++i) rst+=st[i].c;
		rst%=k,op=(rst>0);
		for (int i=1;i<=n;++i)
		{
			res+=st[i].c;
			if (res>=rst&&op) ans+=st[i].v,res-=rst,op=0;
			if (res>=k) ans+=res/k*st[i].v,res%=k;
		}
		printf("%lld\n",ans);
	}
	return 0;
}