#include<bits/stdc++.h>
#define endl '\n'
#define all(x) x.begin(),x.end()
#define ios ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<long long, long long>;

struct info {
    ll w, l ,r;

    bool operator< (const info& b) {
        return this->w > b.w ? true : false;
    }
};



void solve() {
    ll n, m;
    cin >> n >> m;
    vector<info> a(n), b(n);
    for(auto&& [w, l, r] : a) {
        cin >> w >> l >> r;
    }
    ll lastend = 1;
    vector<info> sa(a);
    sort(all(sa));
    vector<ll> leftnum(n);
    for(int i = 0 ; i < n ; i++) {
        auto&& [w, l ,r] = sa[i];
        auto&& [bw, start, end] = b[i];
        bw = w;
        leftnum[i] = r - l;
        start = lastend;
        end = start + leftnum[i];
        lastend = end; 
    }
    vector<ll> val(1e6 + 5);
    for(auto&& [bw, start, end] : b) {
        val[start] += bw;
        val[end] -= bw;
    }
    for(int i = 1 ; i < 1e6 + 5 ; i++) {
        val[i + 1] += val[i];
    }
    for(int i = 1 ; i < 1e6 + 5 ; i++) {
        val[i + 1] += val[i];
    }
    vector<ll> prenum(leftnum);
    for(int i = 1 ; i < n ; i++) {
        prenum[i] += prenum[i - 1];
    }
    for(int i = 0 ; i < n ; i++) {
        prenum[i] -= leftnum[i];
        prenum[i] = min(prenum[i], sa[i].l);
    }

    ll basic = 0;
    ll lftm = m;
    ll extr = 0;
    for(auto [w, l ,r] : a) {
        basic += w * l;
        lftm -= l;
    }
    extr = val[lftm];

    ll ans = basic + extr;
    for(int i = 0 ; i < n ; i++) {
        auto [w, l, r] = sa[i];
        auto [bw, start, end] = b[i];
        ll ans1 = 0;// add
        ll ans2 = 0;// de
        ans1 = basic + lftm * w;
        
        ll fixnum = lftm + prenum[i];
        ll denum = prenum[i];
        ans2 = basic + val[fixnum] - w * denum;
        ans = max(ans, max(ans1, ans2));
    }
    cout << ans << endl;
}

signed main() {
    ios;
    int _ = 1;
    //cout << fixed << setprecision(2);
    //cin >> _;
    while(_--) solve();
    return 0;
}