#include<bits/stdc++.h>

int main() {
	std::cin.tie(nullptr)->sync_with_stdio(false);

	int n;
	int64_t m;
	std::cin >> n >> m;
	std::vector<std::tuple<int64_t, int64_t, int64_t>> wei(n);
	int64_t cost = 0;
	int64_t sum_l = 0, sum_c = 0;
	for (auto& [w, l, r] : wei) std::cin >> w >> l >> r, sum_l += l, sum_c += l * w;
	std::sort(wei.begin(), wei.end(), std::greater<>());
	// for (auto [w, l, r] : wei) std::cout << w << ' ' << l << ' ' << r << std::endl;
	std::vector<int64_t> pref_delt(n + 1);
	std::vector<int64_t> pref_w(n + 1);
	for (int i = 0; i < n; ++i) {
		auto [w, l, r] = wei[i];
		pref_delt[i + 1] = pref_delt[i] + r - l;
		pref_w[i + 1] = pref_w[i] + (r - l) * w;
	}
	// for (auto i : pref_delt) std::cout << i << ' ';
	// std::cout << std::endl;
	int64_t ret = 0;
	for (int i = 0; i < n; ++i) {
		auto [w, l, r] = wei[i];
		sum_l -= l;
		sum_c -= w * l;
		int64_t need = m - sum_l;
		// std::cout << i << ' ' << need << std::endl;
		if (pref_delt.back() - (r - l) >= need && need >= 0) {
			if (need == 0) {
				ret = std::max(ret, sum_c);
			} else {
				int q = std::lower_bound(pref_delt.begin(), pref_delt.end(), need) - pref_delt.begin() - 1;
				if (q >= i) {
					q = std::lower_bound(pref_delt.begin(), pref_delt.end(), need + r - l) - pref_delt.begin() - 1;
				}
				int64_t delt = pref_delt[q];
				if (q >= i) delt -= r - l;
				int64_t ans = sum_c + pref_w[q] + (need - delt) * std::get<0>(wei[q]);
				if (q >= i) ans -= (r - l) * w;
				// std::cout << i << ' ' << ans << ' ' << sum_c << ' ' << q << ' ' << delt << std::endl;
				ret = std::max(ret, ans);
			}
		}
		sum_l += l;
		sum_c += w * l;
	}
	std::cout << ret;
}