#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(x) (x&-x)
#define gcd __gcd
#define i128 __int128
#define rep(i, a, b) for(ll i = (a); i <= (b); i++)
#define per(i, a, b) for(ll i = (a); i >= (b); i--)
const int N=1e6+10,M=3e6+10;
const ll mod=1e9+7;
const ld eps=1e-12;
const double pi=acos(-1.0);
const double pi1=pi/180,pi2=180/pi;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//unordered_map<int,int>mp;
#define poly vector<int>

void solve()
{
	ll n,k;
	cin>>n>>k;
	array<ll,3> a[n+1];
	for(int i=1;i<=n;i++)
	{
		int x,y,h;
		cin>>x>>y>>h;
		a[i]={h,x,y};
	}
	sort(a+1,a+1+n);
	reverse(a+1,a+1+n);
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		auto [h,num,w]=a[i];
		ans+=h*(num/(k/w));
		ll diff=num-num/(k/w)*(k/w);
		if(diff)
		{
			ans+=h;
			diff=k-diff*w;
			if(diff==0) continue;
			for(int j=i+1;j<=n;j++)
			{
				auto &[h1,num1,w1]=a[j];
				ll have=min(num1,diff/w1);
				num1-=have;
				diff-=have*w1;
				if(diff==0) break;
			}
		} 
	}
	cout<<ans<<endl;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);

	int T=1;
	cin>>T;

	while(T--)
	{
		solve();
	}
	return 0;
}