#include <bits/stdc++.h>
#define int ll
#define For(i, l, r) for (int i=l; i<=r; ++i)
using namespace std;
typedef long long ll;
template <typename T>
inline void read(T &x) {
	char c = getchar(); int w = 1; x = 0;
	while (!isdigit(c))
		(c == '-') && (w = -w), c = getchar();
	while (isdigit(c))
		x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
	x *= w;
}

const int N = 100010;
int n, m, use[N], sum[N], Up[N], Pre[N];
struct node {
	int w, l, r;
	inline bool operator < (const node &rhs) const {
		return w < rhs.w;
	}
} a[N];
signed main() {
	read(n); read(m);
	ll m1 = m;
	For(i, 1, n) {
		read(a[i].w); read(a[i].l); read(a[i].r);
		m1 -= a[i].l;
	}
	std :: sort(a + 1, a + n + 1);
	ll Ans = 0;
	For(i, 1, n) {
		Ans = Ans + a[i].w * a[i].l;
		use[i] = a[i].l;
	}
	Ans += (m1) * a[n].w;
	int Id = -1;
	sum[n+1] = 0;
	Up[n+1] = 0;
	for (int i=n; i>=1; --i) {
		if (a[i].r-a[i].l <= m1) {
			m1 -= a[i].r-a[i].l;
			use[i] = a[i].r;
		}
		else {
			use[i] += m1; m1 = 0;
		}
		if (use[i] < a[i].r && Id == -1) {
			Id = i;
		}
		sum[i] = sum[i+1] + a[i].r-use[i];
		Up[i] = Up[i+1] + a[i].r * a[i].w;
	}
	Pre[0] = 0;
	For(i, 1, n) {
		Pre[i] = Pre[i-1] + use[i] * a[i].w;
	}
	for (int i=1; i<Id; ++i) {
		int l = i+1, r = Id;
		while (l <= r) {
			int mid = l+r >> 1;
			if (sum[mid] >= a[i].l) l = mid+1;
			else r = mid-1;
		}
		if (r == i) r = i+1;
		ll now = 0;
		if (sum[r] <= a[i].l) {
			now = Up[r] + Pre[r-1] - sum[r] * a[i].w;
		}
		else {
			now = Up[r+1] + Pre[r-1] + (a[i].l-sum[r+1]) * a[r].w - a[i].l * a[i].w;
		}
		Ans = max(Ans, now);
	}
	cout << Ans << endl;
	return 0;
}