#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

int main(){
 	cin.tie(0);
 	ios::sync_with_stdio(false);
 	int n;
 	long long m;
 	cin >> n >> m;
 	vector<int> w(n), l(n), r(n);
 	forn(i, n){
 		cin >> w[i] >> l[i] >> r[i];
 	}
 	vector<int> ord(n);
 	iota(ord.begin(), ord.end(), 0);
 	sort(ord.begin(), ord.end(), [&](int i, int j){
 		return w[i] < w[j];
 	});
 	vector<int> nl = l, nr = r, nw = w;
 	forn(i, n){
 		nl[i] = l[ord[i]];
 		nr[i] = r[ord[i]];
 		nw[i] = w[ord[i]];
 	}
 	l = nl, r = nr, w = nw;
 	long long ans = 0;
 	long long sl = 0;
 	forn(i, n) sl += l[i];
 	long long sl2 = 0;
 	forn(i, n) sl2 += l[i] * 1ll * w[i];
 	vector<long long> su(n + 1), su2(n + 1);
 	for (int i = n - 1; i >= 0; --i){
 		su[i] = su[i + 1] + (r[i] - l[i]);
 		su2[i] = su2[i + 1] + (r[i] - l[i]) * 1ll * w[i];
 	}
 	forn(i, n){
 		long long lft = m - sl + l[i];
 		ans = max(ans, sl2 - l[i] * 1ll * w[i] + lft * 1ll * w[i]);
 	}
// 	cerr << "ans = " << ans << endl;
 	forn(i, n){
 		int lf = i - 1, rg = n;
 		while (rg - lf > 1) {
 			int mid = (lf + rg) >> 1;
 			int need = su[mid];
 			if (mid == i)
 				need += l[i];
 			int have = m - (sl - l[i]);
 			if (have < need)
 				lf = mid;
 			else
 				rg = mid;
 		}
 		if (rg == i)
 			continue;
 		
// 		cerr << i << " - " << rg << endl;
 		
 		long long cur = su2[rg] + sl2 - l[i] * 1ll * w[i];
	 	long long rem = su[rg] + sl - l[i];
	 	assert(rem <= m);
 		ans = max(ans, cur + w[rg - 1] * 1ll * (m - rem));
 		
 	}
 	cout << ans << '\n';
}