#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;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].first >> a[i].second.first >> a[i].second.second;
        cnt += a[i].second.second;
    }
    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 d[n+2]={0},e[n+2]={0};
    for(int i=n;i>=1;i--)
    {
        d[n-i+1]=d[n-i]-t[i]+a[i].second.second;
        e[n-i+1]=e[n-i]+(-t[i]+a[i].second.second)*a[i].first;
    }
    // for(int i=1;i<=n;i++)
    // {
    //     cout<<a[i].first<<' '<<a[i].second.first<<' '<<a[i].second.second<<' '<<t[i]<<' '<<d[i]<<' '<<e[i]<<'\n';
    // }
    ll a2=0;
    for(int i=1;i<=n;i++)
    {
        ll l=0,r=n-i;
        while(l+1<r)
        {
            ll mid=(l+r)/2;
            if(d[mid]<t[i])
            l=mid;
            else r=mid;
        }
        a2=max(a2,e[l]+(t[i]-d[l])*a[n-l].first-t[i]*a[i].first);
        // cout<<l<<' '<<r<<' '<<d[l]<<' '<<e[l]<<'\n';
    }
        // cout<<a2<<'\n';
    for(int i=1;i<=n;i++)
    {
        a2+=t[i]*a[i].first;
    }
    cout<<a2;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}