#include <bits/stdc++.h>
#define int long long

using i64 = long long;

struct node {
    int w, l, r;
} ;

void solve() {
    int n;
    i64 m;
    std::cin >> n >> m;
    std::vector < node > a(n);
    for(int i = 0; i < n; ++i) std::cin >> a[i].w >> a[i].l >> a[i].r;
    std::sort(a.begin(), a.end(), [&](const node &x, const node &y) {
        return x.w > y.w;
    });
    i64 ans = 0, re = 0;
    for(int i = 0; i < n; ++i) {
        re += 1LL * a[i].l * a[i].w;
        m -= a[i].l;
    }
    auto cb = re;
    std::vector < i64 > sum(n + 1), add(n + 1);
    for(int i = 0; i < n; ++i) {
        sum[i + 1] = sum[i] + (a[i].r - a[i].l);
        add[i + 1] = add[i] + 1LL * a[i].w * (a[i].r - a[i].l);
    }
    i64 M = m;
    for(int i = 0; i < n; ++i) {
        cb -= 1LL * a[i].l * a[i].w;
        m += a[i].l;
        int l = 0, r = i, to = 0;
        while(l <= r) {
            int mid = (l + r) >> 1;
            if(sum[i] <= m) {
                l = mid + 1;
                to = mid;
            } else {
                r = mid - 1;
            }
        }
        // std::cout << m << ' ' << i << ' ' << a[i].w << ' ' << to << '\n';
        ans = std::max(ans, cb + add[to] + 1LL * (m - sum[to]) * a[to].w);
        ans = std::max(ans, re + 1LL * M * a[i].w);
        i64 cnt = std::min(1LL * (a[i].r - a[i].l), M);
        M -= cnt;
        re += 1LL * cnt * a[i].w;
        cb += 1LL * a[i].l * a[i].w;
        m -= a[i].l;
    }
    std::cout << ans << '\n';
}

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