#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

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

    ll n, m;
    cin >> n >> m;
    vector<array<int, 3>> a(n + 1);
    for (int i = 1; i <= n; i ++) {
        int w, l, r;
        cin >> w >> l >> r;
        a[i] = {w, l, r};
    }

    sort(a.begin() + 1, a.end(), [&](array<int, 3> &x, array<int, 3> &y) -> bool {
        return x[0] > y[0];
    });

    ll tot = 0;
    vector<ll> sum(n + 1), cnt(n + 1);
    for (int i = 1; i <= n; i++) {
        tot += 1ll * a[i][0] * a[i][1];
        m -= a[i][1];
        sum[i] = sum[i - 1]  + 1ll * a[i][0] * (a[i][2] - a[i][1]);
        cnt[i] = cnt[i - 1] + 1ll * (a[i][2] - a[i][1]);
    }

    ll ans = tot;
    for (int i = 1; i <= n; i++) {
        ll cur = m + a[i][1];
        int pos = upper_bound(cnt.begin() + 1, cnt.begin() + i, cur) - cnt.begin() - 1;
        cur -= cnt[pos];
        ll t = tot - 1ll * a[i][0] * a[i][1] + sum[pos] + cur * a[i][0];
        ans = max(t, ans);
    }

    cout << ans;

    return 0;
}