#include <bits/stdc++.h>
#define endl '\n'

using ll = long long;

constexpr int N = 2e5 + 10;
constexpr int M = 1e6;	
constexpr int mod = 998244353;

using namespace std;

struct BIT{
	ll tr[M + 1000];
	int lowbit(int x) {return x & (-x);}
	void add(int p, ll val) {
		for (; p <= M; p += lowbit(p)) {
			tr[p] += val;
		}
	}
	ll query(int p) {
		ll res = 0;
		for (; p; p -= lowbit(p)) {
			res += tr[p];
		}
		return res;
	}
}t1, t2;

void solve(){
	ll n, m;
	cin >> n >> m;
	ll ans = 0, sum = 0, tot = 0;
	vector<ll> w(n + 1), tl(n + 1), tr(n + 1);
	for (int i = 1; i <= n; ++i) {
		cin >> w[i] >> tl[i] >> tr[i];
	}
	for (int i = 1; i <= n; ++i) {
		sum += tl[i];
		tot += tl[i] * w[i];
	}
	for (int i = 1; i <= n; ++i) {
		t1.add(M - w[i] + 1, tr[i] - tl[i]);
		t2.add(M - w[i] + 1, (tr[i] - tl[i]) * w[i]);
	}
	for (int i = 1; i <= n; ++i) {
		t1.add(M - w[i] + 1, m - tr[i]);
		t2.add(M - w[i] + 1, (m - tr[i]) * w[i]);	
		ll rst = m - (sum - tl[i]);
		ll l = 1, r = M, res;
		while (l <= r) {
			ll mid = (l + r) >> 1;
			if (t1.query(M - mid + 1) >= rst) {
				res = mid;
				l = mid + 1;
			}else {
				r = mid - 1;
			}
		}
		ans = max(ans, tot - tl[i] * w[i] + t2.query(M - res + 1) - (t1.query(M - res + 1) - rst) * res);
		t1.add(M - w[i] + 1, -(m - tr[i]));
		t2.add(M - w[i] + 1, -(m - tr[i]) * w[i]);	
	}
	cout << ans << endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}