#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr<<#x<<(x)<<"\n"
#define db1(x) cerr<<#x<<(x)<<" "
#define rep(i,a,b) for(auto i=(a);i<=(b);i++)
#define ll long long
const int N = 1e5+10;
ll n,m,sw;
ll suf[N],pre[N],prew[N],sufw[N],ans,tmpans,suml;
struct st{
    ll l,r,w;
    bool operator<(const st& T)const{
        return w<T.w;
    }
};
st a[N];
int main()
{
    cin>>n>>m;
    rep(i,1,n){
        cin>>a[i].w>>a[i].l>>a[i].r;
        suml+=a[i].l;
        sw+=(a[i].l)*a[i].w;
    }
    sort(a+1,a+1+n);
    for(int i=n;i>=1;i--){
        suf[i] = suf[i+1]+a[i].r-a[i].l;
        sufw[i] = sufw[i+1]+(a[i].w)*(a[i].r-a[i].l);
    }
    rep(i,1,n){
        prew[i] = prew[i-1]+(a[i].w)*(a[i].l);
        pre[i] = pre[i-1]+a[i].l;
     //   cout<<a[i].w<<" "<<a[i].l<<" "<<a[i].r<<"\n";
    }
    // rep(i,1,n){
    //     db(i),db(pre[i]);
    // }
    for(int i=1;i<=n;i++){
        ll nsum = m-(suml-a[i].l);
    //    db1(i),db(nsum);
        int l = i-1,r =n+1;
        while(l+1<r){
            int mid = (l+r)>>1;
            if(suf[mid]<=nsum){
                r = mid;
            }else l = mid;
        }
        //答案是r 的位置但是还剩下一些
        ll recnt = nsum-suf[r];
        tmpans = 0;
        if(recnt!=0){
            tmpans = tmpans+a[r-1].w*recnt;
        }
        tmpans +=(sufw[r]+sw-(a[i].l)*a[i].w);
        // if(tmpans>ans){
        //     cout<<"i======="<<i<<"\n";
        // }
        ans = max(ans,tmpans);
    }
    cout<<ans<<"\n";
}