#include <bits/stdc++.h>
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using db = double;
using i128 = __int128;
#define Emu Smile
using namespace std;

const int P = 998244353;

void yes() { cout << "Yes\n"; }
void no() { cout << "No\n"; }

void chmax(auto &a,auto b) { if (a < b) a = b; }
void chmin(auto &a,auto b) { if (a > b) a = b; }

void solve() {
	int n; ll T; cin >> n >> T;
	vector<array<ll,3>> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	sort(all(a), [&](array<ll,3> x, array<ll,3> y){
		return x[0] > y[0];
	});
	ll suml = 0, suml_w = 0;
	for (int i = 0; i < n; ++i) {
		suml += a[i][1];
		suml_w += a[i][1] * a[i][0];
	}
	ll ret = 0;
	{
		ll t = T - suml, w = suml_w;
		for (int i = 0; i < n; ++i) {
			ll mt = min(t, a[i][2] - a[i][1]);
			w += mt * a[i][0];
			t -= mt;
			if (!t) break;
		}
		chmax(ret, w);
	}
	vector<ll> preT(n+1), preT_w(n+1);
	for (int i = 0; i < n; ++i) {
		preT[i+1] = preT[i] + a[i][2] - a[i][1];
		preT_w[i+1] = preT_w[i] + (a[i][2] - a[i][1]) * a[i][0];
	}
	for (int i = 0; i < n; ++i) {
		ll t = T - suml + a[i][1], w = suml_w - a[i][1] * a[i][0];
		ll it = upper_bound(all(preT), t) - preT.begin() - 1;
		chmin(it, i);
		t -= preT[it], w += preT_w[it] + a[i][0] * t;
		chmax(ret, w);
	}
	cout << ret << '\n';
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

	cout << fixed << setprecision(10);

//	init();

	int OuO = 1;
//	cin >> OuO;
	for (int piastic = 0; piastic < OuO; ++piastic) {
		solve();
	}
	return 0;
}