// MagicDark
#include <bits/stdc++.h>
#define int long long
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 3e5 + 10;
int n, k;
struct node {
	int c, w, v;
} a[N];
void zhk() {
	int ans = 0;
	read(n), read(k);
	F(i, 1, n) read(a[i].c), read(a[i].w), read(a[i].v);
	sort(a + 1, a + n + 1, [&] (node x, node y) {
		return x.v > y.v;
	});
	int pos = 1;
	for (int i = 1, j; i <= n; i = j) {
		if (!a[i].c) {
			j = i + 1;
			continue;
		}
		int kk = k;
		j = i;
		while (j <= n && kk >= a[j].w * a[j].c) kk -= a[j].w * a[j].c, a[j].c = 0, j++;
		if (j == i) {
			int t = kk / a[j].w;
			
			int cc = a[i].c / t;
			ans += cc * a[i].v;
			a[i].c -= cc * t;
			// if (!a[i].c) j++;
		} else {
			ans += a[i].v;
			if (j <= n) {
				int t = kk / a[j].w;
				kk -= t * a[j].w;
				a[j].c -= t;
				if (kk) {
					while (pos <= n && (pos < j || !a[pos].c || a[pos].w == 2)) pos++;
					// debug << pos << endl;
					a[pos].c--;
				}
			}
		}
		// F(t, 1, n) cout << a[t].c << " " << a[t].w << " " << a[t].v << endl;
		// debug << ans << endl;
	}
	cout << ans << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/