#include<bits/stdc++.h>
using namespace std;
int n;long long m;
struct crop{
    long long c,l,r,w;
}C[100005];
long long S[100005];
long long Sw[100005];
long long solve(int p){
    long long sur=C[p].c;
    int l=p+1,r=n,mid;
    while(l<=r){
        mid=(l+r)/2;
        if(sur>=S[mid])
        r=mid-1;
        else
        l=mid+1;
    }
    long long cad=Sw[l]-C[p].c*C[p].w;
    sur-=S[l];cad+=sur*C[l-1].w;
    return cad;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>C[i].w>>C[i].l>>C[i].r;
    }
    sort(C+1,C+n+1,[](crop &x,crop &y){return x.w<y.w;});
    long long base=0;
    for(int i=1;i<=n;i++){
        m-=C[i].l;C[i].c=C[i].l;base+=C[i].w*C[i].l;
    }
    long long ans=base+m*C[n].w;
    for(int i=n;i>=1;i--){
        if(m>C[i].r-C[i].c){
            m-=(C[i].r-C[i].c);
            base+=(C[i].r-C[i].c)*C[i].w;
            C[i].c=C[i].r;
        }else{
            base+=m*C[i].w;
            C[i].c+=m;m=0;break;
        }
    }
    for(int i=n;i>=1;i--){
        S[i]=S[i+1]+C[i].r-C[i].c;
        Sw[i]=Sw[i+1]+(C[i].r-C[i].c)*C[i].w;
    }
    for(int i=n-1;i>=1;i--){
        ans=max(ans,base+solve(i));
    }
    cout<<ans;
    return 0;
}