// #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define IOS                      \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0);
#define pb push_back
#define st first
#define nd second
#define PII pair<ll, ll>
#define D(x, y) cout << x << "=" << y << endl;
#define fcout(x, n) cout << fixed << setprecision(x) << n << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
// #define int long long
// #define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
const ll inf = 0x3f3f3f3f;
const int N = 1e6 + 10;
const int M = 1e9+7;
inline ll read()
{
    ll x = 0;
    bool f = 1;
    char c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = 0;
    for (; isdigit(c); c = getchar())
        x = (x << 3) + (x << 1) + c - '0';
    return f ? x : 0 - x;
}
inline void out(ll x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        out(x / 10);
    putchar(x % 10 + '0');
}
// __int128 rd()
// {
// 	char arr[30];
// 	__int128 res = 0;
// 	scanf("%s", arr);
// 	for (int i = 1; i <= strlen(arr); i++)
// 	{
// 		res *= 10;
// 		res += arr[i]-'0';
// 	}
// 	return res;
// }
// void pt(__int128 num)
// {
// 	if (num > 9) pt(num / 10);
// 	putchar(num % 10 + '0');
// }

ll n, m;
class P
{public:
    ll w,l,r;
}p[N];
bool cmp(P a,P b)
{
    return a.w>b.w;
}
ll sums[N]={0},sumt[N]={0};
void solve()
{
    cin>>n>>m;
    ll lt=0,ls=0;
    rep(i,1,n+1)
    {
        cin>>p[i].w>>p[i].l>>p[i].r;
        lt+=p[i].l;ls+=p[i].l*p[i].w;
    }
    ll ans=ls;
    if(lt==m) return cout<<ans<<endl,void();
    sort(p+1,p+n+1,cmp);
    sums[0]=sumt[0]=0;
    rep(i,1,n+1)
    {
        sums[i]=sums[i-1]+p[i].w*(p[i].r-p[i].l);
        sumt[i]=sumt[i-1]+p[i].r-p[i].l;
    }
    rep(i,1,n+1)
    {
        ll dt=p[i].l+m-lt;
        if(sumt[i-1]<=dt) 
        {
            ans=max(ans,ls+sums[i-1]+p[i].w*(dt-sumt[i-1]-p[i].l));
            continue;
        }
        auto t=upper_bound(sumt,sumt+i,dt)-sumt;
        ans=max(ans,ls+sums[t-1]+(dt-sumt[t-1])*p[t].w-p[i].w*p[i].l);
    }
    cout<<ans<<endl;
}
signed main()
{
    IOS
        // freopen("../.vscode/io/in.txt","r",stdin),freopen("../.vscode/io/out.txt","w",stdout);
        ll T = 1;
    // cin >> T;
    while (T--)
        solve();
}