#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;

const int N = 2e5 + 10;

struct pp{
    ll w, l, r;
}p[N];

ll sum[N], val[N];

bool cmp(pp a, pp b){
    return a.w < b.w;
}

void solve(){
    ll n, m;

    cin >> n >> m;

    ll ans = 0, res = 0;

    for(int i = 1; i <= n; i ++){
        cin >> p[i].w >> p[i].l >> p[i].r;

        ans += p[i].w * p[i].l;

        res += p[i].l;
    }

    sort(p + 1, p + n + 1, cmp);

    //for(int i = 1; i <= n; i ++) cout << p[i].w << ' ' << p[i].l << ' ' << p[i].r << '\n';
    //cout << '\n';

    for(int i = n; i >= 1; i --){
        sum[i] = sum[i + 1] + p[i].r - p[i].l;
        val[i] = val[i + 1] + (p[i].r - p[i].l) * p[i].w;
    }

    ll ans1 = ans + (m - res) * p[n].w;

    for(int i = 1; i <= n; i ++){
        ll ti = m - res + p[i].l, cur = ans - p[i].w * p[i].l;
        ll l = 0, r = n + 1;

        //cout << cur << ' ';

        while(r - l > 1){
            ll mid = (l + r) / 2;

            ll k = sum[mid] + (i >= mid ? (p[i].r - p[i].l) : 0);

            if(k > ti) l = mid;
            else r = mid;
        }

        cur += val[r] + min(ti - sum[r], p[l].r - p[l].l) * p[l].w - (i >= r ? p[i].r * p[i].w : 0);

        if(ti - sum[l] > 0) cur += (ti - sum[l]) * p[i].w;

        //cout << r << ' ' << val[r] << ' ' << sum[r] << ' ' << cur << '\n';

        ans1 = max(ans1, cur);
    }

    cout << ans1 << '\n';
}

int main(){
    ios::sync_with_stdio(0), cin.tie(0);

    ll T = 1;

    //cin>>T;

    while(T--)
    {
        solve();
    }

    return 0;
}