#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;
using ll = long long;
struct fio {
    char gc() {return getchar();}
    template <typename T> void read(T& x) {
        char c = gc(), l = 0; x = 0;
        while (!isdigit(c)) l = c, c = gc();
        while ( isdigit(c)) x = (x << 1) + (x << 3) + c - 48, c = gc();
        if (l == '-') x = -x;
    }
    template <typename T, typename ...A> void read(T& x, A&... a) {
        read(x), read(a...);
    }
} IO;
const int N = 1e5 + 10;
struct dat {
    ll w, l, r;
} a[N];
bool operator < (dat a, dat b) {
    return a.w > b.w;
}
ll w[N], len[N], sum[N];
ll n, m;
struct BIT {
    ll c[N];
    #define lowbit(x) ((x) & -(x))
    void add(int x, ll val) {
        while (x <= n) {
            c[x] += val;
            x += lowbit(x);
        } return;
    }
    ll qsum(int x) {
        ll res = 0;
        while (x) {
            res += c[x];
            x -= lowbit(x);
        } return res;
    }
} T;
int main() {
    IO.read(n, m);
    for (int i = 1; i <= n; i++) IO.read(a[i].w, a[i].l, a[i].r);
    sort(a + 1, a + n + 1);
    ll Sl = 0, res = 0, tmpm = 0;
    for (int i = 1; i <= n; i++) {
        w[i] = a[i].w, len[i] = a[i].r - a[i].l;
        // printf("i:%d w:%lld l:%lld r:%lld\n", i, w[i], a[i].l, a[i].r);
        T.add(i, len[i]);
        Sl += a[i].l * w[i];
        sum[i] = sum[i - 1] + w[i] * len[i];
        tmpm += a[i].l;
    }
    for (int o = 1; o <= n; o++) { // 让第 o 个物品放宽限制
        T.add(o, m - len[o]);
        int l = 0, r = n; ll rst = m - (tmpm - a[o].l);
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (T.qsum(mid) <= rst) l = mid;
            else r = mid - 1;
        }
        // printf("o:%d l:%d rst:%lld Sl:%lld\n", o, l, rst, Sl);
        ll now = Sl - a[o].l * w[o];
        now += sum[l]; rst -= T.qsum(l);
        if (l < n && rst) {
            now += w[l + 1] * rst;
        }

        res = max(res, now);
        T.add(o, len[o] - m);
    }
    printf("%lld\n", res);
    return 0;
}
/*
5 17
2 3 4
6 1 5
8 2 4
4 3 3
7 5 5
*/