#include <bits/stdc++.h>
#define F first
#define S second
#define int long long
using namespace std;

const int N = 1e5 + 10;
int n , k;
struct gem{
	int c , w , f;
};
gem a[N];

bool cmp(gem aa , gem bb)
{
	return aa.f > bb.f;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);  cout.tie(0);
	int Tc;
	cin >> Tc;
	while(Tc--)
	{
		cin >> n >> k;
		for(int i = 0 ; i < n ; i++)
			cin >> a[i].c >> a[i].w >> a[i].f;
		sort(a , a + n , cmp);
		int ans = 0 , cap1 = k , cap2 = k;
		for(int i = 0 ; i < n ; i++)
		{
			if(cap1 != k)
			{
				int x = min((cap1 / a[i].w) , a[i].c);
				cap1 -= x * a[i].w;
				a[i].c -= x;
			}
			if(cap2 != k)
			{
				int x = min((cap2 / a[i].w) , a[i].c);
				cap2 -= x * a[i].w;
				a[i].c -= x;
			}
			if(cap1 == 0)
				cap1 = k;
			if(cap2 == 0)
				cap2 = k;
			if(cap1 > cap2)
				swap(cap1 , cap2);
			if(a[i].c == 0)
				continue;
			int tmp = (k / a[i].w);
			ans += (a[i].c / tmp) * a[i].f;
			a[i].c %= tmp;
			if(cap1 == 1)
				swap(cap1 , cap2);
			ans += a[i].f;
			cap1 -= a[i].c;
			if(cap1 > cap2)
				swap(cap1 , cap2);
		}
		cout << ans << '\n';
	}
	return 0;
}