#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define mp make_pair
#define endl '\n'
#define dbug() cout << '||||||debug|||||' << endl;
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
const int N = 1e5+10;
const int mod = 1e9+7;
const int INF = 1e18;
struct node{
    int w, l, r;
};
struct SB{
    int ti, tal;
};
void solve()
{
    int n, m, k;
    int ma= 0;
    cin >> n >> m;
    vector<node> v(n+1);
    for (int i = 1; i<=n; i++){
        cin >> v[i].w >> v[i].l >> v[i].r;
    }    
    vi pre(n+1), ti(n+1);
    
    sort(v.begin()+1, v.end(), [](node a, node b){
        return a.w < b.w;
    });
    for (int i = 1; i<=n; i++){
        pre[i] = pre[i-1]+v[i].w*v[i].l;
        ti[i] = ti[i-1]+v[i].l;
    }
    vector<SB> sb(n+2);
    // cout << pre[n] << " " << ti[n] << endl;
    for (int i = n; i>=1; i--){
        int tp = v[i].r-v[i].l;
        sb[i].ti = sb[i+1].ti+tp;
        sb[i].tal = sb[i+1].tal + tp*v[i].w;
    }
    // for (int i = n; i>=1; i--){
    //     cout << sb[i].ti << " " << sb[i].tal << endl;
    // }

    for (int i = 1; i<=n; i++){
        int val = pre[n]- v[i].w*v[i].l;
        int tt = ti[n]-v[i].l;
        tt = m-tt;
        int l = i-1, r = n+1;
        while (l+1 < r){
            int mid = (l+r)/2;
            if (sb[mid].ti <= tt){
                r = mid;
            }
            else{
                l = mid;
            }
        }
        if(r!=i+1){
            val += sb[r].tal;
            int pp = tt-sb[r].ti;
            val+=v[r-1].w*pp;
        }else{
            
            val += sb[r].tal;
            int pp = tt-sb[r].ti;
            val += v[i].w * pp;
        }
        
        
        // cout << val << endl;
        ma = max(ma, val);
    }
    cout << ma << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}