#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()

bool chmin(auto &a, auto b) { return (b < a) and (a = b, true); }
bool chmax(auto &a, auto b) { return (a < b) and (a = b, true); }

using i64 = long long;

constexpr i64 inf = 1E18;

void solve() {
    int n;
    i64 m;
    cin >> n >> m;

    vector<array<i64, 3>> A(n);
    for (auto &[a, l, r] : A) {
        cin >> a >> l >> r;
    }

    sort(all(A));

    auto ans = [&]() -> i64 {
        i64 rem = m;
        i64 ans = 0;
        for (int i = 0; i < n; i++) {
            auto [a, l, r] = A[i];
            if (i == n - 1) {
                l = 0, r = inf;
            }
            ans += l * a;
            rem -= l;
        }
        for (int i = n - 1; i >= 0; i--) {
            auto [a, l, r] = A[i];
            if (i == n - 1) {
                l = 0, r = inf;
            }
            i64 t = min(rem, r - l);
            ans += t * a;
            rem -= t;
        }
        return ans;
    }();

    i64 cur = 0;
    i64 rem = m;
    vector<i64> use(n);
    for (int i = 0; i < n; i++) {
        auto [a, l, r] = A[i];
        use[i] = l;
        cur += a * use[i];
        rem -= use[i];
    }

    vector<i64> val;
    vector<pair<i64, i64>> pres{{0, 0}};
    for (int i = n - 1; i >= 0; i--) {
        auto [a, l, r] = A[i];

        if (val.size()) {
            i64 k = min(l, pres.back().ff);
            i64 ns = cur - k * a;
            auto it = --lower_bound(all(pres), pair<i64, i64>{k + 1, -1});
            // cerr << "idx = " << it - pres.begin() << " siz = " << pres.size() << '\n';
            // cerr << " val siz = " << val.size() << '\n';
            ns += it->ss;
            if (it->ff - k > 0) {
                ns += (it->ff - k) * val[it - pres.begin()];
            }
            chmax(ans, ns);
        }

        i64 t = min(rem, r - use[i]);
        rem -= t;
        cur += t * a;
        use[i] += t;

        if (use[i] < r) {
            val.push_back(a);
            auto x = pres.back();
            x.ff += r - use[i];
            x.ss += (r - use[i]) * a;
            pres.push_back(x);
        }
    }

    cout << ans << '\n';
}


signed main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}