#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e5 + 10;
struct node{
    ll v;
    ll l,r,t,sl,sr,lt,rt;
}e[maxn];
bool cmp(node x,node y){return x.v<y.v;}
int n,md;
ll m,now=0,ans=0;
bool check(int i,int tp){
    if(e[i].rt<tp) return false;
    return true;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    ll r=m;
    for(int i=1;i<=n;i++){
        cin>>e[i].v>>e[i].l>>e[i].r;
    }
    sort(e+1,e+1+n,cmp);
    for(int i=1;i<=n;i++){
        r-=e[i].l;
        e[i].t=e[i].l;
    }
    for(int i=n;i>=1;i--){
        if(r>=e[i].r-e[i].l){
            r-=e[i].r-e[i].l;
            e[i].t=e[i].r;
        }
        else {
            e[i].t+=r;
            md=i;break;
        }
    }
    r=m;
    for(int i=1;i<=n;i++) ans+=e[i].v*e[i].t;
    //cout<<ans<<"\n";
    for(int i=1;i<=n;i++) {e[i].sl=e[i-1].sl+e[i].v*e[i].l;}//cout<<e[i].sl<<" ";}cout<<"\n";
    for(int i=n;i>=1;i--) {e[i].sr=e[i+1].sr+e[i].v*e[i].r;}//cout<<e[i].sr<<" ";}cout<<"\n";
    for(int i=1;i<=n;i++) {e[i].lt=e[i-1].lt+e[i].t-e[i].l;}//cout<<e[i].lt<<" ";}cout<<"\n";
    for(int i=n;i>=1;i--) {e[i].rt=e[i+1].rt+e[i].r-e[i].t;}//cout<<e[i].rt<<" ";}cout<<"\n";
    for(int i=1;i<=n;i++){
        if(md<i){
            now=e[i-1].lt*e[i].v+e[i+1].sr+e[i-1].sl;
            ans=max(ans,now);
        }
        else if(i<md){
            ll tp=e[i].t;
            if(e[i+1].rt<=tp) now=(tp-e[i+1].rt)*e[i].v+e[i-1].sl+e[i+1].sr;
            else{
                int L=i+1,R=md,j;
                while(L<R){
                    int mid=(L+R)>>1;
                    if(check(mid,tp)){L=mid+1;j=mid;}
                    else {R=mid-1;}
                }
                now=(tp-e[j+1].rt)*e[j].v+e[j-1].sl+e[j+1].sr;
            }
            ans=max(now,ans);
        }
    }
    cout<<ans;
    return 0;
}