#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int N = 1e5 + 100;

int n;
LL m;
struct DATA {
    LL w, l, r;
} d[N];

bool cmp(DATA &a, DATA &b) {
    return a.w > b.w;
}

LL pre[N], prew[N];


LL calc(int x, LL rm) {
    if(pre[x - 1] <= rm)
        return prew[x - 1] + d[x].w * (rm - pre[x - 1]);
    
    int l = 1, r = x - 1;
    while(l < r) {
        int md = (l + r) / 2;
        if(pre[md] <= rm) r = md - 1;
        else l = md + 1;
    }
    return prew[r] + (rm - pre[r]) * d[l].w;
}

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

    cin >> n >> m;
    LL sum = 0;
    for(int i = 1; i <= n; ++i) {
        cin >> d[i].w >> d[i].l >> d[i].r;
        m -= d[i].l;
        sum += d[i].w * d[i].l;
    }
    sort(d + 1, d + 1 + n, cmp);
    for(int i = 1; i <= n; ++i) {
        pre[i] = pre[i - 1] + d[i].r - d[i].l;
        prew[i] = prew[i - 1] + (d[i].r - d[i].l) * d[i].w;
    }
// for(int i = 1; i <= n; ++i)
//     cerr << pre[i] << ' ' << prew[i] << endl;


// return 0;
// cerr << sum << ' ' << m << endl;
    LL ans = 0;
    for(int i = 1; i <= n; ++i) {
        ans = max(ans, sum - d[i].l * d[i].w + calc(i, m + d[i].l));
// cerr << m + d[i].l << ' ' << calc(i, m + d[i].l) << ' ' << sum - d[i].l * d[i].w + calc(i, m + d[i].l) << endl;
    }

    cout << ans << endl;
    return 0;
}