#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 101;

int p[N], v[N];

struct node {
	int w, l, r, val; 
} a[N];

bool cmp(node u, node v) {
	if (u.w <= v.w) return true;
	else return false;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, m; cin >> n >> m;
	int all = 0, tim = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].w >> a[i].l >> a[i].r;
		a[i].val = a[i].w * (a[i].r - a[i].l);	// 可以多的贡献
		
		all += a[i].w * a[i].l;
		tim += a[i].l;
	}
	sort(a + 1, a + n + 1, cmp);
	
	for (int i = n; i >= 1; --i) {
		p[i] = p[i + 1] + a[i].r - a[i].l;		// 可以做的时间 
		v[i] = v[i + 1] + a[i].val;				// 可以多的贡献 
	}
	
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		int now = all - a[i].w * a[i].l, t = m - tim + a[i].l;
		int l = i + 1, r = n, k = n + 1;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (p[mid] <= t) r = mid - 1, k = mid;
			else l = mid + 1;
		}
		now += v[k], t -= p[k];
		k -= 1;
		now += t * a[i].w;
		ans = max(ans, now);
	}
	cout << ans;
	
	return 0;	
}