#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
void debug() {std::cerr << "\n";}
template<class T, class... OtherArgs>
void debug(T &&var, OtherArgs &&... args) {
    std::cerr << std::forward<T>(var) << " ";
    debug(std::forward<OtherArgs>(args)...);
}
#define SZ(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using i64 = long long;
using u64 = unsigned long long;
using LD = long double;
using PII = pair<int, int>;
constexpr int N = 300010;
constexpr int P = 1e9 + 7;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<array<int, 3>> a(n);
    int t = 0, cost = 0;
    for (int i = 0; i < n; i++) {
        auto &[w, l, r] = a[i];
        cin >> w >> l >> r;
        m -= l;
        cost += w * l;
    }
    
    sort(all(a));

    vector<int> suf(n + 1), sufres(n + 1);
    for (int i = n - 1; ~i; i--) {
        auto &[w, l, r] = a[i];
        suf[i] = suf[i + 1] + r - l;
        sufres[i] = sufres[i + 1] + (r - l) * w;
    }

    int ans = 0;
    for (int i = 0; i < n - 1; i++) {
        auto &[w, l, r] = a[i];
        int rest = m + l;
        int j = lower_bound(all(suf), rest, greater()) - suf.begin();
        // debug("?", i, j, rest, sufres[j + 1]);
        rest -= suf[j + 1];
        ans = max(ans, cost - w * l + sufres[j + 1] + rest * a[j][0]);
    }
    cout << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
}