#include <bits/stdc++.h>
#define int long long

using namespace std;

struct Node {
    int w, l, r;

    // 定义比较运算符
    bool operator<(const Node &other) const {
        if (w != other.w) {
            return w < other.w;
        } else {
            return (r-l)<(other.r-other.l);
        }
    }
};

void solve()
{
    int n,m;
    cin>>n>>m;
    vector<Node>res(n+1);
    int val=0;
    int tot=0;
    for(int i=1;i<=n;i++){
        int w,l,r;
        cin>>w>>l>>r;
        res[i]={w,l,r};
        val+=w*l;
        tot+=l;
    }

    sort(res.begin()+1,res.end());

    vector<int>sum(n+1,0);
    vector<int>cnt(n+1,0);

    for(int i=1;i<=n;i++){
        sum[i]=sum[i-1]+(res[i].r-res[i].l)*res[i].w;
        cnt[i]=cnt[i-1]+(res[i].r-res[i].l);
    }
    int ans=0;
    if(tot==m){
        ans=val;
    }
    for(int i=1;i<=n;i++){
        int num=tot-res[i].l;
        int now=val-res[i].w*res[i].l;
        if(m>=num){
            int need=m-num;
            int l=0,r=n-1;
            while(l<r){
                int mid=l+r+1>>1;
                if(cnt[n]-cnt[mid]+(mid>=i?0:(res[i].l))>=need)   l=mid;
                else r=mid-1;
            }
            if(cnt[n]-cnt[l]+(l>=i?0:(res[i].l))==need){
                ans=max(ans,now+sum[n]-sum[l]+(l>=i?0:(res[i].l)*res[i].w));
            }else{
                l+=1;
                int p=need-(cnt[n]-cnt[l]+(l>=i?0:(res[i].l)));
                ans=max(ans,now+sum[n]-sum[l]+(l>=i?0:(res[i].l)*res[i].w)+p*res[l-1].w);
            }
        }

    }
    
    cout<<ans<<'\n';


}

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