#include <bits/stdc++.h>

using i64 = long long;

struct Node {
	i64 w, l, r;
};

void solve() {
	i64 n, m;
	std::cin >> n >> m;
	std::vector<Node> a(n + 1);
	for (int i = 1; i <= n; ++ i) {
		i64 w, l, r;
		std::cin >> w >> l >> r;
		a[i] = {w, l, r};
	}

	std::sort(a.begin() + 1, a.end(), [&](Node & a, Node & b){
		return a.w < b.w;
	});

	i64 lsum = 0, ltot = 0;
	for (int i = 1; i <= n; ++ i) {
		auto & [w, l, r] = a[i];
		lsum += l;
		ltot += w * l;
	}

	i64 ans = 0;
	for (int i = 1; i <= n; ++ i) {
		auto & [w, l, r] = a[i];
		i64 sum = m - (lsum - l);
		i64 tot = ltot - l * w;
		ans = std::max(ans, tot + sum * w);
	}

	std::vector<i64> suf(n + 2), sufw(n + 2);
	for (int i = n; i >= 1; -- i) {
		suf[i] = suf[i + 1] + a[i].r - a[i].l;
		sufw[i] = sufw[i + 1] + (a[i].r - a[i].l) * a[i].w;
	}

	// auto check = [&](int i, int j) -> i64 {
	// 	if (i > j) {
	// 		return suf[i];
	// 	}	

	// 	i64 sum = suf[j + 1] + suf[i] - suf[j];
	// 	return sum;
	// };

	for (int i = 1; i <= n; ++ i) {
		i64 sum = m - (lsum - a[i].l);
		i64 tot = ltot - a[i].l * a[i].w;
		int l = 1, r = n;
		while (l < r) {
			int mid = l + r >> 1;
			if (suf[mid] <= sum) {
				r = mid;
			} else {
				l = mid + 1;
			}
		}

		// std::cout << l << " " << tot  << " ";

		tot += sufw[l];
		sum -= suf[l];
		-- l;
		tot += sum * a[l].w;
		// std::cout << tot << "\n";
		ans = std::max(ans, tot);
	}

	std::cout << ans << "\n";
}

int main() {
	std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);
	int T = 1;
	// std::cin >> T;
	while (T -- ) {
		solve();
	}
	return 0;
}