#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct s
{
    int w, l, r, c, cw;
    bool operator<(const s &W) const { return w > W.w; }
};
void solve()
{
    ll n, m;
    cin >> n >> m;
    s a[n + 5];
    ll maxn = 0;
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].w >> a[i].l >> a[i].r;
        ans += a[i].l * a[i].w;
        m -= a[i].l;
        a[i].c = a[i].r - a[i].l;
        a[i].cw = a[i].c * a[i].w;
    }
    sort(a + 1, a + n + 1);
    ll sum[n + 5] = {}, pre[n + 5] = {};
    for (int i = 1; i <= n; i++)
    {
        sum[i] = sum[i - 1] + a[i].cw;
        pre[i] = pre[i - 1] + a[i].c;
    }
    for (int i = 1; i <= n; i++)
    {
        ll cnt = m + a[i].l;
        ll p = upper_bound(pre + 1, pre + i, cnt) - pre - 1; 
        cnt -= pre[p];
        maxn = max(maxn, ans - a[i].l * a[i].w + sum[p] + cnt * a[p + 1].w);
    }
    cout<<maxn<<endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin>>t;
    while (t--)
        solve();
    return 0;
}