#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
#define endl '\n'
#define sz(x) (int)(x).size()
#define all(t) (t).begin(), (t).end()
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define debug(x) cout<<#x<<": "<<x<<endl
const int N=2e5+10,M=1e6+10;

struct node {
	ll l;
	ll r;
	ll w;
};

bool cmp(node x, node y) {
	return x.w < y.w;
}

void solve() 
{
	int n, m;
	cin >> n >> m;
	node a[n + 5];
	ll sl[n + 5], sr[n + 5], ansl[n + 5], ansr[n + 5];
	memset(sl, 0, sizeof(sl));
	memset(sr, 0, sizeof(sr));
	memset(ansl, 0, sizeof(ansl));
	memset(ansr, 0, sizeof(ansr));
	rep(i, 1, n) {
		cin >> a[i].w >> a[i].l >> a[i].r;
	}
	sort(a + 1, a + n + 1, cmp);
	rep(i, 1, n) {
		sl[i] = sl[i - 1] + a[i].l;
		sr[i] = sr[i - 1] + a[i].r;
		ansl[i] = ansl[i - 1] + a[i].l * a[i].w;
		ansr[i] = ansr[i - 1] + a[i].r * a[i].w;
	}
	ll maxx = 0;
	rep(i, 1, n) {
		ll x = m - sl[i - 1], ans = ansl[i - 1], l = i + 1, r = n;
		if(i == n || a[n].r + sl[n - 1] - sl[i] >= x) {
			maxx = max(maxx, ans + ansl[n - 1] - ansl[i] + max(x - sl[n - 1] + sl[i], 0ll) * a[n].w);
		}
		while(l < r) {
			ll mid = (l + r) >> 1;
			if(sr[n] - sr[mid - 1] + sl[mid - 1] - sl[i] <= x) {
				r = mid;
			}
			else {
				l = mid + 1;
			}
		}
		ans += ansr[n] - ansr[l - 1];
		x -= sr[n] - sr[l - 1];
		ans += ansl[l - 1] - ansl[i];
		x -= sl[l - 1] - sl[i];
		ans += x * a[i].w;
		maxx = max(maxx, ans);
	}
	cout << maxx;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	// cin >> T;
	//	cout.flush();
	//		ofstream outfile("C:\\Users\\86187\\OneDrive\\桌面\\1.txt");
	//		outfile << "a[1]=0;a[2]=1;";
	//		ll l = 1e7 + 1;
	//		rep(i, 3, 1e9) {
	//			printf("%lld\n", i);
	//			ll x = (i - 1) * ((a[i - 1] + a[i - 2]) % mod);
	//			x %= mod;
	//			if(i == l) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//			}
	//			if(i == l + 1) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//				l += 1e7;
	//			}
	//		}
	while(T--) {
		solve();
	}
	return 0;
}