#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct s
{
    int w, l, r, c;
    bool operator<(const s &W) const { return w < W.w; }
};
void solve()
{
    ll n, m;
    cin >> n >> m;
    s a[n + 5];
    ll sum = 0, num = 0;
    ll maxn = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].w >> a[i].l >> a[i].r;
        a[i].c = a[i].r - a[i].l;
        sum += a[i].l * a[i].w;
        num += a[i].l;
    }
    sort(a + 1, a + n + 1);
    maxn = sum + (m - num) * a[n].w;
    ll tmp = m - num;
    for (int i = n; i >= 1; i--)
    {
        if (tmp - a[i].c >= 0)
        {
            tmp -= a[i].c;
            sum += a[i].w * a[i].c;
            num += a[i].c;
            a[i].c = 0;
            a[i].l = a[i].r;
        }
        else
        {
            sum += a[i].w * tmp;
            num += tmp;
            a[i].c -= tmp;
            a[i].l += tmp;
            break;
        }
    }
    maxn = max(maxn, sum);
    // cout << num << endl;

    int z[n + 5] = {}, v[n + 5] = {};
    for (int i = n; i >= 1; i--)
    {
        z[i] = z[i + 1] + a[i].c;
        v[i] = v[i + 1] + a[i].c * a[i].w;
    }
    // for (int i = 1; i <= n; i++)
    // {
    //     cout << z[i] << " ";
    // }
    // cout << endl;
    // cout << sum << endl;
    for (int i = 1; i <= n; i++)
    {
        tmp = sum;
        int l = 1, r = n;
        while (l < r)
        {
            int mid = (l + r + 1) / 2;
            if (a[i].l >= z[mid])
            {
                r = mid - 1;
            }
            else
            {
                l = mid;
            }
        }
        if (l >= i)
        {
            // cout << i << " " << a[i].l << " " << l << " " << r << endl;
            if (z[l] > a[i].l)
            {
                tmp = tmp - a[i].l * a[i].w + v[l + 1] + (a[i].l - z[l + 1]) * a[l].w;
                maxn = max(tmp, maxn);
                // cout << tmp << "11111111111111" << endl;
            }
            else if (z[l] == a[i].l)
            {
                if (l == i)
                    tmp = tmp - a[i].l * a[i].w + v[l + 1] + (a[i].l - z[l + 1]) * a[i].w;
                else
                    tmp = tmp - a[i].l * a[i].w + v[l];
                maxn = max(tmp, maxn);
                // cout << tmp << "22222222222222222222" << endl;
            }
            else if (z[l] < a[i].l)
            {
                //   cout << tmp << " "<<z[l] <<" "<<l<<" "<<v[l+1]<<endl;
                tmp = tmp - z[l] * a[i].w + v[l + 1] + (z[l] - z[l + 1]) * a[i].w;
                maxn = max(tmp, maxn);
                // cout << tmp << "333333333" << endl;
            }
        }
    }

    cout << maxn << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}