#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0),cout.tie(0)
#define endl '\n'
#define PII pair<int, int>
#define int long long
//#define int __int128
using namespace std;
inline int read();
inline void write(int x);
const int N = 1e5 + 10, M = 2e3 + 10, mod = 998244353, inf = 1e18, base = 131;
const double eps = 1e-7;
int n, m;
struct node{
    int x, l, r;
}p[N];
int s[N], f[N];
bool cmp(node a, node b){
    return a.x > b.x;
}
void solve(){
    cin >> n >> m;
    int ans = 0;
    int cnt = 0;
    for(int i = 1; i <= n; i++){
        int a, b, c;
        cin >> a >> b >> c;
        p[i] = {a, b, c};
        ans += b * a;
        cnt += b;
    }
    sort(p + 1, p + 1 + n, cmp);
    for(int i = 1; i <= n; i++){
        s[i] = s[i - 1] + p[i].r - p[i].l;
        f[i] = f[i - 1] + (p[i].r - p[i].l) * p[i].x;
    }
    int res = 0;
    for(int i = 2; i <= n; i++){
        int t = m - cnt + p[i].l;
        if(t >= s[i - 1]){
            t -= s[i - 1];
            res = max(res, ans - p[i].l * p[i].x + f[i - 1] + t * p[i].x);
        }
        else{
            int l = 0, r = i - 1;
            while(l < r){
                int mid = l + r + 1 >> 1;
                if(t >= s[mid]){
                    l = mid;
                }
                else r = mid - 1;
            }
            t -= s[l];
            res = max(res, ans - p[i].l * p[i].x + f[l] + t * p[i].x);
        }
    }
    cout << res << endl;
}
signed main() {
    IOS;
    int T = 1;
    //cin >> T;
    while (T--){
        solve();
    }
}
inline int read() {
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
    return x * f;
}
inline void write(int x) {
    if (x < 0) putchar('-'), x = -x;
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
}