#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e5 + 5;
ll n, m, t[N];
struct node{
    ll l, r, w;
}a[N];
ll len, f[N], g[N], id[N];
int main(){
    read(n, m);
    _rep(i, 1, n) read(a[i].w, a[i].l, a[i].r);
    sort(a + 1, a + 1 + n, [](node x, node y){return x.w < y.w;});
    _rep(i, 1, n) debug("[%d,%d] %d\n", a[i].l, a[i].r, a[i].w);
    ll cur = 0, sum = 0, ans = 0;
    _rep(i, 1, n) t[i] = a[i].l, sum += a[i].w * t[i], cur += t[i];
    _req(i, n, 1){
        ll now = min(m - cur, a[i].r - t[i]);
        cur += now, sum += a[i].w * now, t[i] += now;
    }
    // debug("sum:%d cur:%d\n", sum, cur);
    // _rep(i, 1, n) debug("%d ", t[i]); debug("\n");
    ans = sum;
    _req(i, n, 1){
        if(len){
            ll pos = upper_bound(f + 1, f + 1 + len, t[i]) - f, now = sum;
            if(pos > len) now += g[pos - 1] - f[pos - 1] * a[i].w;
            else now += g[pos - 1] + a[id[pos]].w * (t[i] - f[pos - 1]) - t[i] * a[i].w;
            ans = max(ans, now);
        }
        if(t[i] < a[i].r){
            len++; ll now = a[i].r - t[i];
            f[len] = f[len - 1] + now, g[len] = g[len - 1] + now * a[i].w, id[len] = i;
            // debug("i:%d len:%d f:%d g:%d\n", i, len, f[len], g[len]);
        }
    }
    ll tot = 0, tots = 0;
    _rep(i, 1, n){
        ll now = sum - tots + tot * a[i].w;
        ans = max(ans, now);
        tot += t[i] - a[i].l, tots += (t[i] - a[i].l) * a[i].w;
    }
    writeln(ans);
    return 0;
}