#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;

const int N=1e5+10;
struct crop
{
    ll l,r,w;
}C[N];
ll suml[N],sumr[N],sumlw[N],sumw[N];

int n,Res;
ll m,ans=0;
bool cmp(crop a,crop b) {return a.w>b.w;}

void calc(int x)
{
    int res=Res+C[x].l;
    ll ret=sumlw[n]-C[x].l*C[x].w;
    if(x==1)
    {
        ret+=res*C[1].w;
        ans=max(ret,ans);
        return ;
    }
    int l=1,r=n+1;
    while(r-l>1)
    {
        int mid=(l+r)>>1;
        if(sumr[mid]-suml[mid]<=res) l=mid;
        else r=mid;
    }
    if(l>=x) l=x-1;
    ret+=sumw[l];
    res-=sumr[l]-suml[l];
    ret+=res*C[x].w;
    ans=max(ret,ans);
    return ;
}
signed main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>C[i].w>>C[i].l>>C[i].r;
    sort(C+1,C+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        suml[i]=suml[i-1]+C[i].l,sumr[i]=sumr[i-1]+C[i].r;
        sumlw[i]=sumlw[i-1]+C[i].l*C[i].w;
        sumw[i]=sumw[i-1]+C[i].w*(C[i].r-C[i].l);
    }
    //for(int i=1;i<=n;i++) cout<<sumw[i]<<endl;
    Res=m-suml[n];
    for(int i=1;i<=n;i++) calc(i);
    cout<<ans;
    return 0;
}