#include <bits/stdc++.h>
#define int long long 
#define pb push_back
using namespace std;
const int INF=1e6+5;
int n,m,w[INF],p[INF],l[INF],r[INF],S[INF],S2[INF];
void solve() {
    cin>>n>>m;int suml=0,res=0,ans=0;
    for (int i=1;i<=n;i++) {
        cin>>w[i]>>l[i]>>r[i];
        suml+=l[i];res+=l[i]*w[i];
        p[i]=i;
    }
    sort(p+1,p+1+n,[](int x,int y){return w[x]>w[y];});
    for (int i=1;i<=n;i++) 
        S[i]=S[i-1]+(r[p[i]]-l[p[i]]),
        S2[i]=S2[i-1]+(r[p[i]]-l[p[i]])*w[p[i]];
    for (int i=1;i<=n;i++) {
        int s1=suml-l[p[i]],r1=res-l[p[i]]*w[p[i]];
        s1=m-s1;
        if (s1>=S[i-1]) 
            ans=max(ans,r1+(s1-S[i-1])*w[p[i]]+S2[i-1]);
        else {
            int L=1,R=i-1,ans=-1;
            while (L<=R) {
                int Mid=(L+R)>>1;
                if (S[Mid]>=s1) R=(ans=Mid)-1;
                else L=Mid+1;
            }
            assert(ans!=-1);
            int it=S2[ans-1]+r1+(s1-S[ans-1])*w[p[ans]];
            ans=max(ans,it);
        }
        // int L=1,R=i,ans=-1;
        // ans=max(ans,res-l[i]*)
    }
    cout<<ans<<"\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    int t=1;
    while (t--) solve();
    return 0;
}