#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
void solve() {
    ll n, m;
    cin >> n >> m;
    vector<tuple<ll, ll, ll>> v;
    rep(i, n) {
        ll w, l, r;
        cin >> w >> l >> r;
        v.emplace_back(w, l, r);
    }
    sort(v.begin(), v.end());
    ll res = 0, rem = m;
    for (auto [w, l, r] : v) {
        rem -= l;
        res += w * l;
    }
    vector<pair<ll, ll>> p(n);
    rep(i, n) p[i].first = get<1>(v[i]);
    for (int i = n - 1; i >= 0; i--) {
        auto [w, l, r] = v[i];
        ll d = min(rem, r - l);
        res += w * d;
        rem -= d;
        p[i].second = p[i].first + d;
    }
    vector<ll> suml0, suml1, sumr0, sumr1;
    rep(i, n) {
        auto [w, l, r] = v[i];
        ll d = p[i].first - l;
        if (i == 0)
            suml0.push_back(d), suml1.push_back(w * d);
        else
            suml0.push_back(suml0.back() + d), suml1.push_back(suml1.back() + w * d);
    }
    for (int i = n - 1; i >= 0; i--) {
        auto [w, l, r] = v[i];
        ll d = r - p[i].second;
        if (i == n - 1)
            sumr0.push_back(d), sumr1.push_back(w * d);
        else
            sumr0.push_back(sumr0.back() + d), sumr1.push_back(sumr1.back() + w * d);
    }
    ll base = res;
    rep(i, n) {
        auto [w, l, r] = v[i];
        {
            ll idx = lower_bound(sumr0.begin(), sumr0.end(), p[i].first) - sumr0.begin();
            idx = min(idx, n - 1 - i - 1);
            ll val = 0, rem = p[i].first;
            if (idx) val += sumr1[idx - 1], rem -= sumr0[idx - 1];
            val += min(rem, sumr0[idx]) * get<0>(v[n - 1 - idx]);
            rem -= min(rem, sumr0[idx]);
            val -= (p[i].first - rem) * w;
            res = max(res, base + val);
        }
        {
            ll idx = lower_bound(suml0.begin(), suml0.end(), m - p[i].second) - suml0.begin();
            idx = min(idx, r - 1);
            ll val = 0, rem = m - p[i].second;
            if (idx) val -= suml1[idx] - 1, rem -= suml0[idx - 1];
            val -= min(rem, suml0[idx]) * get<0>(v[idx]);
            rem -= min(rem, suml0[idx]);
            val += (m - p[i].second - rem) * w;
            res = max(res, val);
        }
    }
    cout << res << endl;
}
int main() {
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) solve();
}