#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<bitset>
#include<cstring>
#include<queue>
#define fi first
#define se second
using namespace std;
using ll=long long;
typedef pair<int,int>PII;
const int N=1e5+10;
struct node{
    ll w,l,r;
}a[N];
int n;
ll m;
ll suf[N];
ll suf_cost[N];
void silverwolf(){
    cin>>n>>m;
    ll ans=0;
    ll res=0,costm=m;
    for(int i=1;i<=n;i++){
        ll w,l,r;
        cin>>w>>l>>r;
        a[i]={w,l,r};
        res+=w*l;
        costm-=l;
    }
    sort(a+1,a+n+1,[](node x,node y){
        return x.w<y.w;
    });
    for(int i=n;i>=1;i--){
        suf[i]=suf[i+1]+a[i].r-a[i].l;
        suf_cost[i]=suf_cost[i+1]+a[i].w*(a[i].r-a[i].l);
    }
    for(int i=1;i<=n;i++){
        auto [w,l,r]=a[i];
        //cout<<w<<' '<<l<<' '<<r<<'\n';
    }
    //for(int i=1;i<=n;i++)cout<<suf[i]<<' ';cout<<'\n';
   // for(int i=1;i<=n;i++)cout<<suf_cost[i]<<' ';cout<<'\n';
    //cout<<'\n';
    for(int i=1;i<=n;i++){
        //ban
        auto [w,l,r]=a[i];
        res-=w*l;
        costm+=l;
        //cout<<i<<' '<<costm<<'\n';
        if(suf[i+1]<=costm){
            ll tmp=res+suf_cost[i+1]+(costm-suf[i+1])*w;
            ans=max(ans,tmp);
            res+=w*l;
            costm-=l;
            //cout<<i<<' '<<tmp<<'\n';
            //cout<<i<<' '<<r<<' '<<tmp<<'\n';
            continue;
        }
        int L=i+1,R=n;
        while(L<R){
            int mid=L+R>>1;
            if(suf[mid]<=costm)R=mid;
            else L=mid+1;
        }
        ll tmp=res+suf_cost[R]+(costm-suf[R])*(a[R-1].w);
        // cout<<i<<' '<<R<<' '<<tmp<<'\n';
        ans=max(ans,tmp);
        res+=w*l;
        costm-=l;
    }
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //int T;cin>>T;while(T--)
    silverwolf();
    return 0;
}