#include <bits/stdc++.h>
//#define int long long 
#define INF 0x3f3f3f3f3f3f3f3f
#define fr first
#define se second
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;

const int N = 2e5 + 10;

int n;
ll m;

struct Corn
{
    int w,l,r;
    bool operator < (const Corn& t) const
    {
        return w < t.w;
    }
}a[N];

struct Segtree
{
    #define lc p<<1
    #define rc p<<1|1

    struct Node
    {
        int l, r;
		ll sum, add;
    }tr[N * 4];

    void pushup(int p)
    {
        tr[p].sum = tr[lc].sum + tr[rc].sum;
    }

    void pushdown(int p)
    {
        if (tr[p].add)
        {
            tr[lc].sum = tr[p].add * (tr[lc].r - tr[lc].l + 1);
            tr[rc].sum = tr[p].add * (tr[rc].r - tr[rc].l + 1);
            tr[lc].add = tr[p].add;
            tr[rc].add = tr[p].add;
            tr[p].add = 0;
        }
    }

    void build(int p, int l, int r,vector<ll>& arr)
    {
        tr[p] = { l,r,arr[l],0 };
        if (l == r) return;
        int mid = l + r >> 1;
        build(lc, l, mid , arr);
        build(rc, mid + 1, r , arr);
        pushup(p);
    }

    void update(int p, int l, int r, ll k)
    {
        if (l <= tr[p].l && tr[p].r <= r)
        {
            tr[p].sum = 1ll * (tr[p].r - tr[p].l + 1) * k;
            tr[p].add = k;
            return;
        }
        int mid = tr[p].l + tr[p].r >> 1;
        pushdown(p);
        if (l <= mid) update(lc, l ,r, k);
        if (r > mid)  update(rc, l ,r, k);
        pushup(p);
    }

    ll querysum(int p, int l, int r)
    {
        if (l <= tr[p].l && tr[p].r <= r)  return tr[p].sum;
        int mid = tr[p].l + tr[p].r >> 1;
        pushdown(p);
        ll sum = 0;
        if (l <= mid) sum += querysum(lc, l, r);
        if (r > mid) sum += querysum(rc, l, r);
        return sum;
    }

};

Segtree seg1,seg2;

void solve()
{
    cin >> n >> m;

	ll sumr = 0;
	ll sumvalue = 0;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i].w >> a[i].l >> a[i].r;
		sumr += a[i].r;
		sumvalue += 1ll * a[i].r * a[i].w;
    }

    sort(a + 1, a + 1 + n);

	vector<ll> len(n + 1);
	vector<ll> len_w(n + 1);

	for(int i=1;i<=n;i++)
	{
		len[i] = a[i].r - a[i].l;
		len_w[i] = len[i] * a[i].w;
	}

	seg1.build(1,1,n,len);
	seg2.build(1,1,n,len_w);
	
	ll ans = 0;
	for(int i=1;i<=n;i++)
	{
		seg1.update(1,i,i,m);
		seg2.update(1,i,i,m * a[i].w);
		
		ll sumR = sumr - a[i].r + m;
		ll rest = sumR - m;//多出来的时间，需要逐渐减少

		int lo = 0 , hi = n + 1;
		while(lo + 1 < hi)
		{
			int mid = lo + hi >> 1;
			if(seg1.querysum(1,1,mid)<=rest) lo = mid;
			else hi = mid;
		}
		ll sum = seg1.querysum(1,1,lo);
		//assert(sum <= rest);
		ll res = seg2.querysum(1,1,lo) + (rest - sum) * (lo + 1 <= n ? a[lo + 1].w : INF);
		
		ans = max(ans , sumvalue + 1ll * (m - a[i].r) * a[i].w - res);

		seg1.update(1,i,i,len[i]);
		seg2.update(1,i,i,len[i] * a[i].w);
	}
	cout << ans << endl;
}


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