#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<array<int, 3>> crop(n + 3);
    ll res = 0, t = m;
    for (int i = 1; i <= n; ++i)
    {
        int w, l, r;
        cin >> w >> l >> r;
        crop[i] = {w, l, r};
        res += l * w;
        t -= l;
    }
    sort(crop.begin() + 1, crop.begin() + 1 + n, greater<array<int, 3>>());

    vector<ll> pre(n + 1), pval(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        auto [w, l, r] = crop[i];
        pre[i] = pre[i - 1] + r - l;
        pval[i] = pval[i - 1] + 1ll * (r - l) * w;
    }

    ll ans = res;
    for (int i = 1; i <= n; ++i)
    {
        auto [w, l, r] = crop[i];
        ans = max(ans, res + 1ll * t * w);
        int j = lower_bound(pre.begin() + 1, pre.begin() + 1 + n, t + l + 1) - pre.begin();
        --j;
        if (j < i)
        {
            if (j + 1 != i)
                ans = max(ans, res - 1ll * l * w + pval[j] + 1ll * (t + l - pre[j]) * crop[j + 1][0]);
            else
                ans = max(ans, res - 1ll * l * w + pval[j] + 1ll * (t + l - pre[j]) * crop[j + 2][0]);
        }
        else
        {
            int j = lower_bound(pre.begin() + 1, pre.begin() + 1 + n, t + r + 1) - pre.begin();
            --j;
            ans = max(ans, res - 1ll * r * w + pval[j] + 1ll * (t + r - pre[j]) * crop[j + 1][0]);
        }
    }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

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

    return 0;
}