#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define int long long
#define inf 10000000000000000
struct crop{
    ll w, l, r;
};
ll pos[100005];
ll Time[100005];
ll prefix[100005];
void solve(){
    int n, m;
    cin >>n  >> m;
    vector<crop> harvest(n+ 1);
    vector<pair<ll, ll>> add(n +1);
    for(int i = 1; i <= n; i++){
        cin >> harvest[i].w >> harvest[i].l >> harvest[i].r;
    }
    ll init = 0;
    ll remain = m;
    for(int i = 1; i <= n; i++){
        init += harvest[i].w*harvest[i].l;
        remain -= harvest[i].l;
    }
    for(int i = 1; i <= n; i++){
        add[i] = {harvest[i].w,i};
    }
    sort(add.begin() + 1, add.end(), greater<pair<ll,ll>>());
    for(int i = 1; i <= n; i++){
        pos[add[i].second] = i;
        Time[i] = Time[i - 1] + harvest[add[i].second].r - harvest[add[i].second].l;
        prefix[i] = prefix[i-1] + (harvest[add[i].second].r - harvest[add[i].second].l)*add[i].first;
    }
    ll ans = init;
    for(int i = 1;i <= n; i++){
        
        ll cur = init;
        cur -= harvest[i].l*harvest[i].w;
        ll used = remain + harvest[i].l;
        int lo = 1;
        int hi = n;
        int p = -1;
        
        while(lo <= hi){
            int mid = (lo + hi)/2;
            if(Time[mid] <= used){
                p = mid;
                lo = mid + 1;

            }
            else{
                hi = mid - 1;
            }
        }
        if(pos[i] > p){
            ans = max(ans, cur + prefix[p-1] + add[p].first*(used - Time[p-1]));
            
            
        }
        else{
            int x = pos[i];
            ans = max(ans, cur + prefix[x-1] + add[x].first*(used - Time[x-1]));
        }
    }
    cout << ans << endl;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    solve();
    
    
     
}