#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=100010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,m,ans;
struct node{
	int c,w,f;
}a[maxn];
void work(){
	n=read();m=read();ans=0;
	for(int i=1;i<=n;i++)a[i]={read(),read(),read()};
	sort(a+1,a+n+1,[&](node u,node v){return u.f>v.f||(u.f==v.f&&u.c<v.c);});
	int res=0,mx=0;
	for(int i=1;i<=n;i++){
		a[i].c*=a[i].w;
		if(res){
			int d=min(m-res,a[i].c);
			res+=d,a[i].c-=d;
			if(res==m)ans+=mx,res=mx=0;
		}
		int d=a[i].c/m;
		a[i].c-=d*m;
		ans+=a[i].f*d;
		if(a[i].c){
			res=a[i].c,mx=a[i].f;
		}
		// cout<<i<<" "<<res<<" "<<mx<<" "<<ans<<" "<<d<<"\n";
	}
	printf("%lld\n",ans+mx);
}

// \
444

bool Med;
int T;
signed main(){
	 // freopen("lift.in","r",stdin);
	 // freopen("lift.out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=read();
	while(T--)work();
}