#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
int T, n;
ll k;
int num, b[N];
ll ans;
struct node
{
	int c, w, f;
}a[N];
bool cmp(const node &x, const node &y)
{
	return x.f > y.f;
}
void solve(int i, int j)
{
	if (i > n) return;
	ll t = k / a[i].w;
	ll s = a[i].c / t;
	a[i].c -= t * s;
	ans += a[i].f * s;
	if (a[i].c == 0)
	{
		solve(i + 1, j);
		return;
	}
	ans += a[i].f;
	int cur = i;
	ll rst = k;
	while (cur <= n)
	{
		ll tmp = min(rst / a[cur].w, (ll)a[cur].c);
		rst -= tmp * a[cur].w;
		a[cur].c -= tmp;
		if (a[cur].c > 0) break;
		cur++;
	}
	while (j <= num && a[b[j]].c == 0) j++;
	if (j <= num && rst == 1)
	{
		a[b[j]].c--;
		rst--;
	}
	//printf("## %d %d\n", i, ans);
	solve(cur, j);
}
void init()
{
	num = 0;
	ans = 0;
}
int main()
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d%lld", &n, &k);
		init();
		for (int i = 1; i <= n; i++) scanf("%d%d%d", &a[i].c, &a[i].w, &a[i].f);
		sort(a + 1, a + n + 1, cmp);
		for (int i = 1; i <= n; i++)
			if (a[i].w == 1) b[++num] = i;
		solve(1, 1);
		printf("%lld\n", ans);
	}
	return 0;
}