#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
using namespace std;
const int N=1e5+10;
struct node
{
    int w,l,r,sum,diff,Sum;
}a[N];
bool cmp(node a,node b)
{
    return a.w>b.w||a.w==b.w&&a.l<b.l;
}
void solve()
{
    int n,m;cin>>n>>m;
    int L[n+1]={0},R[n+1]={0},S=0;
    for(int i=1;i<=n;i++)
    {
         cin>>a[i].w>>a[i].l>>a[i].r;
        a[i].sum=a[i].w*a[i].l;
        a[i].diff=a[i].r-a[i].l;
        a[i].Sum=a[i].diff*a[i].w;
        S+=a[i].sum;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        L[i]=L[i-1]+a[i].l;
        R[i]=R[i-1]+a[i].r;
    }
    //cout<<L[n]<<" "<<R[n]<<'\n';
    vector<int> diff(n+10,0),Sum(n+10,0);
    for(int i=1;i<=n;i++)
    {
        diff[i]=diff[i-1]+a[i].diff;
        Sum[i]=Sum[i-1]+a[i].Sum;
    }
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        int ans=S;
        int t=L[n];
        ans-=a[i].sum;
        t-=a[i].l;
        int bin=upper_bound(diff.begin(),diff.begin()+i-1,m-t)-diff.begin();
        //cout<<bin<<" ";
           ans+=Sum[bin]+a[bin+1].w*(m-t-diff[bin]);
        //cout<<ans<<" ";
        sum=max(sum,ans);
    }
    cout<<sum<<'\n';
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t=1;//cin>>t;
    while(t--)
        solve();
}