#include <bits/stdc++.h>
using namespace std;

#define ll long long
bool cmp(array<ll, 3> u, array<ll, 3> v) {
	if (u[0] == v[0]) return u[1] < v[1];
	return u[0] > v[0];
}

void solve() {
	ll n, m;
	cin>>n>>m;
	ll tm = m;
	vector<array<ll, 3> > a(n+1);
	for (int i = 1; i <= n; i++) {
		ll w, l, r;
		cin>>w>>l>>r;
		a[i] = {w, l, r};
	}
	sort(a.begin()+1, a.begin()+n+1, cmp);
	ll ans = 0;
	for (int i = 1; i < n; i++) {
		ans += a[i][0] * a[i][1];
		m -= a[i][1];
		a[i][2] -= a[i][1];
	}
	for (int i = 1; i < n; i++) {
		ll mn = min(m, a[i][2]);
		ans += mn * a[i][0];
		m -= mn;
	}
	ans += a[n][0] * m;// 最后一个尽量小 
	
	ll res = 0;
	m = tm;
	for (int i = 2; i <= n; i++) {
		ll mn = min(m, a[i][1]);
		res += mn * a[i][0];
		m -= mn;
	}
	res += m*a[1][0];// 第一个尽量大 
	
	cout<<max(ans, res)<<'\n';
}

int main()
{
	if (ifstream("test.in")) {
		freopen("test.in", "r", stdin);
//		freopen("test.out", "w", stdout);
	}
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
//	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}