#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int long long
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<array<int, 3>> v(n);
    for (auto &[w, l, r] : v)
    {
        cin >> w >> l >> r;
    }
    vector<int> downs(n + 1);
    vector<int> dt(n + 1);
    vector<int> presum(n + 1);
    sort(v.rbegin(), v.rend());
    int anss = 0;
    int noww = 0;
    for (int i = 1; i <= n; i++)
    {
        auto &[w, l, r] = v[i - 1];
        downs[i] = (w * l);
        anss += downs[i];
        noww += l;
        dt[i] = dt[i - 1] + (r - l);
        presum[i] = presum[i - 1] + (r - l) * w;
    }
    int finalans = 0;
    for (int i = 1; i <= n; i++)
    {
        int l = 0, r = i;
        int tmpans = anss - downs[i];
        int res = m - (noww - v[i - 1][1]);
        while (l + 1 < r)
        {
            int mid = (l + r) / 2;
            if (dt[mid] <= res)
                l = mid;
            else
                r = mid;
        }
        tmpans += presum[l];
        res -= dt[l];
        tmpans += res * v[i - 1][0];
        finalans = max(finalans, tmpans);
    }
    cout << finalans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}