#include<bits/stdc++.h>
#define ll long long
#define N 1000005
using namespace std;
ll n,m;
ll w[N],l[N],r[N],ans,sval[N],snum[N];
int main(){
    cin>>n>>m;
    ll sum=0,num=0;
    for(int i=1;i<=n;i++)scanf("%lld%lld%lld",&w[i],&l[i],&r[i]),sum+=w[i]*l[i],num+=l[i];
    for(int i=n;i>=1;i--)sval[i]=sval[i+1]+w[i]*(r[i]-l[i]),snum[i]=snum[i+1]+r[i]-l[i];
    for(int i=1;i<=n;i++){
        ll res=sum-w[i]*l[i],last=m-num+l[i];
        int L=i+1,R=n,mid,pre=i+1;
        while(L<=R){
            mid=(L+R)>>1;
            if(snum[mid]<=last)pre=mid,R=mid-1;
            else L=mid+1;
        }
        if(pre==i+1){
            res+=sval[pre];
            last-=snum[pre];
            res+=last*w[i];
        }else{
            res+=sval[pre];
            last-=snum[pre];
            res+=last*w[pre-1];
        }
        ans=max(ans,res);
    }
    cout<<ans<<"\n";
}