#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define all(s) s.begin(), s.end()
#define pii pair<int,int>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T>
inline void read(T &x){
	x = 0;
	char c = getchar();
	bool f = 0;
	for (; !isdigit(c); c = getchar()) f ^= (c == '-');
	for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
	x = f ? -x : x;
}
template <class T>
inline void write(T x){
	if (x < 0) putchar('-'), x = -x;
	if (x < 10) putchar(x + 48);
	else write(x / 10), putchar(x % 10 + 48);
}
template<typename T> void chkmin(T& lhs, const T& rhs) { lhs = lhs > rhs ? rhs : lhs; }
template<typename T> void chkmax(T& lhs, const T& rhs) { lhs = lhs < rhs ? rhs : lhs; }

const int N = 2e5 + 5;
const int mod = 998244353;
const int INF = 8e18 + 9;
const double eps = 1e-7;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}
mt19937_64 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
	uniform_int_distribution<int> dist(L, R);
	return dist(rnd);
}

inline void sol(){
	int n, k;
	cin >> n >> k;
	vector<array<int, 3>> a(n); 
	int ans = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<3;j++){
			cin >> a[i][j];
		}
	}

	sort(all(a), [&](const array<int, 3> &lhs, const array<int, 3> &rhs){
		return lhs[2] > rhs[2];
	});
	
	int pos = 0;
	for(int i=0, j;i<n;i=j){
		if(!a[i][0]){
			j = i + 1;
			continue;
		}
		int rest = k;
		j = i;
		while(j < n && rest >= a[j][0] * a[j][1]){
			rest -= a[j][0] * a[j][1];
			a[j++][0] = 0;
		}

		if(j == i){
			int onetime = rest / a[j][1];
			int times = a[i][0] / onetime;
			ans += times * a[i][2];
			a[i][0] -= times * onetime;
		}else{
			ans += a[i][2];
			if(j < n){
				int onetime = rest / a[j][1];
				rest -= onetime * a[j][1];
				a[j][0] -= onetime;
				if(rest){
					while(pos < n && (pos < j || !a[pos][0] || a[pos][2] == 2)){
						++pos;
					}
					if(pos < n) a[pos][0]--;
				}
			}
		}
	}
	cout << ans << endl;
}

signed main(){
	IOS;
	int tc = 1;
	cout << fixed << setprecision(10);
	cin >> tc;
	while(tc--){
		sol();
	}
	return 0;
}