#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=int(1e5)+10;
struct Data
{
    int w,l,r;
    void scan(){scanf("%d%d%d",&w,&l,&r);}
    bool operator<(const Data&a)const{return w<a.w;}
}a[N];
LL sl[N],sr[N],ansl[N],ansr[N],m;
int n;
int main()
{
    scanf("%d%lld",&n,&m);
    rep(i,n)a[i].scan();
    sort(a+1,a+n+1);
    for(int i=n;i;i--)
    {
        sl[i]=sl[i+1]+a[i].l;
        sr[i]=sr[i+1]+a[i].r;
        ansl[i]=ansl[i+1]+LL(a[i].w)*a[i].l;
        ansr[i]=ansr[i+1]+LL(a[i].w)*a[i].r;
    }
    LL ans=0;
    for(int i=n;i;i--)
    {
        if(sl[1]-sl[i]+sr[i+1]<=m)
        {
            ans=max(ans,ansl[1]-ansl[i]+ansr[i+1]+(m-(sl[1]-sl[i]+sr[i+1]))*a[i].w);
            continue;
        }
        int l=i,r=n+1;
        LL base=sl[1]-sl[i];
        for(;l<r-1;)
        {
            int mid=(l+r)>>1;
            if(base+sl[i+1]-sl[mid]+sr[mid]>=m)l=mid;else r=mid;
        }
        ans=max(ans,ansl[1]-ansl[i]+ansr[l+1]+ansl[i+1]-ansl[l]+(m-base-(sl[i+1]-sl[l]+sr[l+1]))*a[r].w);
    }
    printf("%lld\n",ans);
    return 0;
}