#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k,p;

typedef struct{
    ll l,r,len,w;
}Node;

Node e[N];

bool cmp(Node &a,Node &b){
    return a.w>b.w;
}

ll s[N],val[N];

int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        ll l,r,w;
        scanf("%lld%lld%lld",&w,&l,&r);
        e[i]={l,r,r-l,w};
    }
    sort(e+1,e+1+n,cmp);
    ll base=0,ans=0;
    
    for(int i=1;i<=n;i++){
        base+=e[i].l*e[i].w;
        m-=e[i].l;
    }
    for(int i=1;i<=n;i++){
        s[i]=e[i].len;
        val[i]=e[i].len*e[i].w;
        s[i]+=s[i-1];
        val[i]+=val[i-1];
    }
    for(int i=1;i<=n;i++){
        if(s[i]>=m){
            ll tot=val[i]-(s[i]-m)*e[i].w;
            ans=tot+base;
            break;
        }
    }
    // cout<<ans<<endl;
    for(int i=1;i<=n;i++){
        ll l=1,r=n;
        ll bbase=base-e[i].l*e[i].w;
        ll mm=m+e[i].l;
        while(l<r){
            ll mid=l+r>>1;
            ll val=s[mid];
            if(mid>=i) val-=e[i].len;
            if(val<mm) l=mid+1;
            else r=mid;
        }
        ll vl=s[l],vl2=val[l];
        if(l>=i){
            vl-=e[i].len;
            vl2-=e[i].len*e[i].w;
        }
        ll tot=bbase+vl2-(vl-mm)*e[l].w;
        ans=max(ans,tot);
    }
    cout<<ans<<endl;
}