#include <bits/stdc++.h>
#define N 100005
#define ll long long
// #define int ll
using namespace std;
struct node {
    int w,l,r,t;
}q[N];
bool cmp(node x,node y){return x.w<y.w;}
ll t_l[N],sum1[N],total,w_t,ans;
ll r_t[N],sum2[N];
signed main() {
    int n,m;scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i) {
        scanf("%d%d%d",&q[i].w,&q[i].l,&q[i].r);
        q[i].t=q[i].r;
        total+=(ll)q[i].r;
    }
    sort(q+1,q+1+n,cmp);
    ll res=total-m;
    for(int i=1;i<=n;++i) {
        if(res) {
            int x = q[i].t-q[i].l;
            int sub = (x<=res)?x:res;
            q[i].t-=sub;
            res-=sub;
        }
    }
    for(int i=1;i<=n;++i) {
        t_l[i]=t_l[i-1]+(ll)(q[i].t-q[i].l);
        sum1[i]=sum1[i-1]+q[i].w*(ll)(q[i].t-q[i].l);
        r_t[i]=r_t[i-1]+(ll)(q[i].r-q[i].t);
        sum2[i]=sum2[i-1]+q[i].w*(ll)(q[i].r-q[i].t);
        w_t+=q[i].w*(ll)q[i].t;
    }
    ans=w_t;
    for(int i=1;i<=n;++i) {
        ll pre = t_l[i-1]; 
        ll sub = sum1[i-1]+q[i].w*(ll)q[i].t;
        ll ti = q[i].t + pre;
        ll find = r_t[n]-(ll)ti;
        int idx = upper_bound(r_t+1+i,r_t+1+n+1,find)-r_t;
        idx = (idx  > n)?n:idx; 
        ll mor=0;
        ll add=0;
        if(idx<n) {
            mor = r_t[n]-r_t[idx];
            add = sum2[n]-sum2[idx];
        }
        if(i+1<idx&&idx<=n) {
            // mor+=ti-(r_t[n]-r_t[idx+1]);
            ll x=min(ti-mor,r_t[idx]-r_t[idx-1]);
            add += x*(ll)q[idx].w;
            mor+=x;
        }
        int res = ti-mor;
        ans=max(ans,w_t-sub+add+res*(ll)q[i].w);
    }
    printf("%lld",ans);
    return 0;
}