#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=101010;

inline ll read() {
	ll sum = 0, ff = 1; char c = getchar();
	while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
	while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
	return sum * ff;
}

ll T;
ll n,K;
struct E{
	ll num,fl,cl;
}a[N];
inline bool cmp(E A,E B) { return A.fl < B.fl; }
ll sum[N];
ll R;

void chushihua() {
	R = 0;
}

int main() {
	T = read();
	while(T--) {
		chushihua();
		n = read(); K = read();
		for(ll i=1;i<=n;i++) {
			a[i].num = read(); a[i].cl = read(); a[i].fl = read();
		}
		sort(a+1,a+n+1,cmp);
		for(ll i=1;i<=n;i++) {
			sum[i] = sum[i-1] + (a[i].cl==1);
			if(a[i].cl==1) R = i;
		}
		ll ans = 0;
		for(ll i=n;i>=1;i--) {
			// for(ll j=1;j<=n;j++) cout<<a[j].fl<<","<<a[j].cl<<","<<a[j].num<<"  ";
			// cout<<"ans = "<<ans<<endl;
			if(a[i].cl * a[i].num >= K) ans += a[i].fl * ((a[i].cl * a[i].num) / K), a[i].num %= K / a[i].cl;
			if(!a[i].num) continue;
			ll now = K;
			ll j = i;
			ans += a[i].fl;
			while(1) {
				if(a[j].cl * a[j].num < now) now -= a[j].cl * a[j].num, a[j].num = 0;
				else { a[j].num -= now / a[j].cl; now %= a[j].cl; break; }
				j--;
				if(j==0) break;
			}
			if(j==0) break;
			R = min(j,R);
			if(sum[R]==0 || now==0) continue;
			ll l = 1, r = R, mid, res;
			while(l<=r) {
				mid = l+r >> 1;
				if(sum[mid]==sum[j]) res = mid, r = mid-1;
				else l = mid+1;
			}
			R = res;
			a[R].num--;
			if(!a[R].num) R--;
		}
		cout<<ans<<"\n";
	}
	return 0;
}