#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
    int n,m;
    cin>>n>>m;
    vector<array<int,3> > a(n+1);
    int sum=0,ma=0,ans=0;
    for(int i=1;i<=n;i++){
        cin>>a[i][0]>>a[i][1]>>a[i][2];
        sum+=a[i][1];
        ans+=a[i][0]*a[i][1];
    }
    sort(a.begin()+1,a.end());
    reverse(a.begin()+1,a.end());

        int ans1=0,l=0,la=0;

        vector<array<int,3>> c;
        vector<int> cc;
        for(int i=1;i<=n;i++){
            int t=ans-a[i][0]*a[i][1];
            
            if(m-sum+a[i][1]>=l){
                t=t+la+(m-sum+a[i][1]-l)*a[i][0];
                ans1=max(ans1,t);
            }
            else {
                auto f=upper_bound(cc.begin(),cc.end(),m-sum+a[i][1])-cc.begin();
                int et=m-sum+a[i][1]-cc[f];
                //cout<<et<<" ";
                if(f+1<c.size())t=t+c[f][2]+et*c[f+1][1];
                else t=t+c[f][2];
                ans1=max(ans1,t);
            }
            
            if(c.empty()){
                c.push_back({a[i][2]-a[i][1],a[i][0],a[i][0]*(a[i][2]-a[i][1])});
            }
            else {
                c.push_back({a[i][2]-a[i][1]+c.back()[0],a[i][0],a[i][0]*(a[i][2]-a[i][1])+c.back()[2]});
                
            }
            cc.push_back(c.back()[0]);
            l+=a[i][2]-a[i][1];
            la+=(a[i][2]-a[i][1])*a[i][0];
            //cout<<ans1<<" ";
        }
        cout<<ans1<<"\n";

}
signed main(){
    cin.tie(0)->ios::sync_with_stdio(0);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--)solve();
}