#include <cstdio>
#include <algorithm>

const int N = 100000;
int n;
std::pair<int, int> mx_l[N];
long long m;
std::pair<int, std::pair<int, int> > a[N];

int main() {
	scanf("%d%lld", &n, &m);
	for (int i = 0; i < n; ++i) scanf("%d%d%d", &a[i].first, &a[i].second.first, &a[i].second.second);
	std::sort(a, a + n);
	long long ans = 0, sli = 0, sum = 0;
	for (int i = 0; i < n; ++i) {
		sli += a[i].second.first;
		mx_l[i + 1] = std::max(mx_l[i], std::make_pair(a[i].second.first, -a[i].first));
		sum += (long long)a[i].second.first * a[i].first;
	}
	for (int k = n; k >= 0; --k) {
		if (k != n) {
			sli += a[k].second.second - a[k].second.first;
			sum += (long long)(a[k].second.second - a[k].second.first) * a[k].first;
		}
		if (k > 0 && sli - mx_l[k - 1].first <= m) {
			long long sum1 = sum + (long long)mx_l[k - 1].first * mx_l[k - 1].second, save = m - sli + mx_l[k - 1].first;
			sum1 += (long long)a[k - 1].first * std::min(save, (long long)a[k - 1].second.second - a[k - 1].second.first);
			ans = std::max(ans, sum1);
		}
		if (k < n && sli <= m) {
			ans = std::max(ans, sum + (long long)a[n - 1].first * (m - sli));
		}
	}
	printf("%lld\n", ans);
	return 0;
}