#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
using namespace std;
using ll = long long;
using PII = pair<int, int>;
struct Data {
    int w, l, r;
};
void solve() 
{
    int n, m;
    cin >> n >> m;
    int lft = m;
    vector<Data> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].w >> a[i].l >> a[i].r;
    }
    sort(next(a.begin()), a.end(), [&](Data x, Data y) {
        if (x .w == y.w)
            return x.l > y.l;
        return x.w < y.w;
    });
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        ans += 1ll * a[i].w * a[i].l;
        lft -= a[i].l;
    }
    // cout << ans << endl;
    ll now = ans;
    ans = ans + lft * (a[n].w);
    // cout << ans << endl;
    int cur = n, res = a[n].l, las = 0;
    ll lassum = 0;
    ll c = now;
    for (int i = 1;i <= n; i++) {
        if (a[i].l <= a[i - 1].l && i != 1)
            continue;
        int b = lft + a[i].l;
        b = b - las;
        las = b;

        // cout << i << " " << b << endl;
        while (cur >= 1 && b) {
            int d = (a[cur].r - res);
            d = min(d, b);
            c += 1ll * d * a[cur].w; 

            res = res + d;
            if (res == a[cur].r) {
                cur--;
                res = a[cur].l;
            }
            b -= d;

            // cout << b << endl;
        }
        ans = max(ans, c - (1ll * a[i].w * a[i].l));

        // cout << i << " " << c - (1ll * a[i].w * a[i].l) << endl;


        // cout << "cur " << cur << endl;
        // cout << "res " << res << endl;
    }
    cout << ans << el;
}   
int main() 
{
    ios:: sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}