#include<iostream>
#include<cstdio>
#include<algorithm>
//#define int long long 
using namespace std;
long long n,k;
struct node{
	long long num,val,cos;
}e[100005];
bool cmp(node x,node y)
{
	return x.cos>y.cos;
}
  inline int read() 
{
    int X=0,w=1; char c=getchar();
    while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
    while (c>='0'&&c<='9') X=(X<<3)+(X<<1)+c-'0',c=getchar();
    return X*w;
}
int main()
{
	long long T;
	cin>>T;
	while(T--)
	{
		n=read();
		k=read();
	long long he=0;
	for(int i=1;i<=n;i++)
	{
		e[i].num=read();e[i].val=read();e[i].cos=read();
		he+=e[i].num*e[i].val;
	}
	sort(e+1,e+1+n,cmp);
	long long ans=0;
	long long i=1;
	long long v=0;
	int co=e[i].cos;
	while(he>k)
	{
		v+=e[i].val;
		e[i].num--;
		if(v>k)
		  {
		  	he-=v;
		  	he+=e[i].val;
		  	v=e[i].val;
		  	ans+=co;
		  	co=e[i].cos;
		  }
		if(e[i].num==0)
		  i++; 
	}
	ans+=co;
	printf("%d\n",ans);
	}
	
	  }