#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int N = 1e6 + 10,M=210;
const int inf=0x3f3f3f3f,mod=998244353;
int pre[N],pre1[N],pre2[N];
struct node
{
    int w,l,r;
}a[N];
bool cmp(node x,node y)
{
    return x.w>y.w;
}
void solve()
{
    int n,m;
    cin>>n>>m;
    int low=0,sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].w>>a[i].l>>a[i].r;
        low+=a[i].l;
        sum+=a[i].w*a[i].l;
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=n;i++)
    {
        pre[i]=pre[i-1]+a[i].r-a[i].l;
        pre2[i]=pre2[i-1]+a[i].w*(a[i].r-a[i].l);
    }
    int less=m-low;
    int pos=lower_bound(pre+1,pre+1+n,less)-pre;
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(i<=pos)
        {
            int temp=sum+pre2[i-1];
            temp+=(less-pre[i-1])*a[i].w;
            ans=max(ans,temp);
        }
        else
        {
            int pos2=lower_bound(pre+1,pre+1+n,a[i].l+less)-pre;
            if(pos2<=pos)
            {
                int temp=sum+pre2[pos2-1];
                temp+=(less+a[i].l-pre[pos2-1])*a[pos2].w;
                ans=max(ans,temp-a[i].l*a[i].w);
            }
        }
    }
    cout<<ans<<endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    // cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}