#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define frep(i,a,b) for(int i=a;i>=b;i--)

constexpr int maxn = 1e5 + 5;
int n, m;
struct node {
	int w, l, r;
} a[maxn];
int la[maxn];
int mla[maxn];
int sum[maxn];
int msum[maxn];

bool cmp(node a, node b) {return a.w > b.w;}

int f(int l, int r, int x)
{
	int t = a[x].r - la[x];
	while (l < r)
	{
		int mid = (l + r) >> 1;
		if (t > sum[mid] - la[x] * (x <= mid))
		{
			l = mid + 1;
		}
		else
		{
			r = mid;
		}
	}
	int res = msum[l - 1] - mla[x] * (x < l) + max(0ll, t - (sum[l - 1] - la[x] * (x < l))) * a[l].w;
	// cout << res << endl;
	return res;
}

void solve()
{
	cin >> n >> m;
	rep(i, 1, n) {cin >> a[i].w >> a[i].l >> a[i].r;}
	sort(a + 1, a + 1 + n, cmp);
	int s = 0, st = 0, sst = 0;
	rep(i, 1, n) {st += a[i].l; s += a[i].w * a[i].l; sst += a[i].r;}
	int last = m - st;
	int ans = s + last * a[1].w;
	int idx = 1;
	while (last >= (a[idx].r - a[idx].l)) {s += (a[idx].r - a[idx].l) * a[idx].w; last -= (a[idx].r - a[idx].l); idx++;}
	rep(i, idx, n) {la[i] = a[i].r - a[i].l - last; mla[i] = la[i] * a[i].w; s += last * a[i].w; last = 0;}
	rep(i, idx, n) {sum[i] = la[i] + sum[i - 1]; msum[i] = mla[i] + msum[i - 1];}
	sum[n + 1] = 1e18;
	msum[n + 1] = msum[n];
	a[n + 1].w = 0;

	// cout << endl;
	// rep(i, 1, n) cout << a[i].w << " " << a[i].l << " " << a[i].r << endl;
	// cout << idx << endl;
	// cout << "la :";rep(i, idx, n) cout << la[i] << " "; cout << endl;
	// rep(i, idx, n) cout << sum[i] << " "; cout << endl;
	// cout << endl;

	rep(i, idx, n)
	{
		int tmp = s - (a[i].r - la[i]) * a[i].w + f(idx, n + 1, i) + a[i].w * (m > sst - a[i].r ? (m - sst + a[i].r) : 0);
		// cout << tmp << endl;
		ans = max(ans, tmp);
	}
	cout << ans;
}

signed main()
{
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(0);
	int _ = 1;
	// cin >> _;
	while (_--) solve();
	return 0;
}