#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<pair<ll, pair<ll, ll>>> a(n+1);
    ll t[n+1]={0},cnt=0;
    ll sum = 0, num = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].first >> a[i].second.first >> a[i].second.second;
        cnt += a[i].second.second;
        sum += a[i].second.first * a[i].first;
        num += a[i].second.first;
    }
    sort(a.begin()+1, a.end());
    for(int i=1;i<=n;i++)
    {
        if(cnt-m>=a[i].second.second-a[i].second.first)
        {
            t[i]=a[i].second.first;
            cnt-=a[i].second.second-a[i].second.first;
        }else{
            t[i]=a[i].second.second-cnt+m;
            cnt=m;
        }
    }
    ll p[n+2]={0},q[n+2]={0},b[n+2]={0},c[n+2]={0};
    for(int i=n;i>=1;i--)
    {
                b[n-i+1]=b[n-i]+a[i].second.second-a[i].second.first;
        c[n-i+1]=c[n-i]+(a[i].second.second-a[i].second.first)*a[i].first;
        p[n-i+1]=p[n-i]+t[n-i+1]-a[n-i+1].second.first;
        q[n-i+1]=q[n-i]+(t[n-i+1]-a[n-i+1].second.first)*a[n-i+1].first;
    }
    ll d[n+2]={0},e[n+2]={0};
    for(int i=1;i<=n;i++)
    {
        d[i]=d[i-1]+a[i].second.second-t[i];
        e[i]=e[i-1]+(a[i].second.second-t[i])*a[i].first;
    }
    // for(int i=1;i<=n;i++)
    // {
    //     cout<<a[i].first<<' '<<a[i].second.first<<' '<<a[i].second.second<<' '<<t[i]<<' '<<b[i]<<' '<<c[i]<<' '<<d[i]<<' '<<e[i]<<'\n';
    // }
    ll a3=0;
    for(int i=1;i<=n;i++)
    {
        a3=max(a3,p[i]*a[i].first-q[i]);
    }
    ll ma=0,pos=0;
for (int i = 1; i <= n; i++)
    {
        int l=1,r=n;
        while(l+1<r)
        {
            int mid=(l+r)/2;
            if(b[mid]<a[i].second.first+m-num)
            {
                r=mid;
            }
            else {
                l=mid;
            }
        }
        // cout<<a[i].second.first+m-num<<' '<<l<<endl;
        if(n-l<i-1)
        break;
        if(ma<(sum+c[l]+(a[i].second.first+m-num-b[l])*a[n-l].first))
        {
            ma=(sum+c[l]+(a[i].second.first+m-num-b[l])*a[n-l].first);
            pos=i;
        }
    }
    // cout<<pos<<endl;
    ll a1 = sum + (m - num) * a.back().first;
    ll a2 = sum - a[pos].first * a[pos].second.first;
    m -= num - a[pos].second.first;
    for (int i = n; i >= 1; i--)
    {
        // cout<<i<<' '<<m<<endl;
        if (i == pos)
            {
                a2+=m*a[i].first;
                break;
            }
        if (m < a[i].second.second - a[i].second.first)
        {
            a2 += m * a[i].first;
            m = 0;
            break;
        }
        else
        {
            a2 += (a[i].second.second - a[i].second.first) * a[i].first;
            m -= a[i].second.second - a[i].second.first;
        }
    }
    for(int i=1;i<=n;i++)
    a3+=t[i]*a[i].first;
    // cout<<a1<<' '<<a2<<' '<<a3<<'\n';
    cout << max({a1, a2,a3});
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}