#include <cstdio>
#include <algorithm>

const int N = 100005;
int n;
std::pair<int, int> mx_l[N];
long long m, sum_l[N], sum_r[N], sum_lp[N], sum_rp[N], total;
std::pair<int, std::pair<int, int> > a[N];

long long split(int rm, int r) {
	total = sum_lp[r] - (rm < r ? (long long)a[rm].first * a[rm].second.first : 0);
	long long num = sum_l[r] - (rm < r ? a[rm].second.first : 0);
	total += sum_rp[n] - sum_rp[r] - (rm >= r ? (long long)a[rm].first * a[rm].second.second : 0);
	num += sum_r[n] - sum_r[r] - (rm >= r ? a[rm].second.second : 0);
	return num;
}

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);
	for (int i = 0; i < n; ++i) {
		sum_l[i + 1] = sum_l[i] + a[i].second.first;
		sum_r[i + 1] = sum_r[i] + a[i].second.second;
		sum_lp[i + 1] = sum_lp[i] + (long long)a[i].first * a[i].second.first;
		sum_rp[i + 1] = sum_rp[i] + (long long)a[i].first * a[i].second.second;
	}
	long long ans = 0;
	for (int i = 0; i < n; ++i) {
		int l = 0, r = n;
		while (l < r) {
			int mid = l + r >> 1;
			if (split(i, mid) > m) l = mid + 1;
			else r = mid;
		}
		int mid = r;
		int save = m - split(i, mid);
		long long cand = total + (mid ? save * a[mid - 1].first : 0);
		ans = std::max(ans, cand);
		save = m - (sum_r[n] - sum_r[i + 1] + sum_l[i]);
		if (save >= 0) {
			cand = sum_rp[n] - sum_rp[i + 1] + sum_lp[i];
			cand += (long long)save * a[i].first;
			ans = std::max(ans, cand);
		}
	}
	printf("%lld\n", ans);
	return 0;
}