#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
const int N = 1e5 + 10;

int pre[N];
int prenum[N];
int sum = 0, num = 0;

struct node
{
    int l, r, w;
}g[N];

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

int pd(int z, int i)
{
    int l = 0, r = i;
    int ans = 0;

    while (l <= r)
    {
        int mid = l + r >> 1;
        if (pre[mid] < z) l = mid + 1, ans = mid;
        else r = mid - 1;
    }
    int t = z - pre[l];
    return t * g[i].w + prenum[l];
}

void solve()
{
    cin >> n >> m;
    for (int i = 0; i < n; i ++)
    {
        cin >> g[i].w >> g[i].l >> g[i].r;
        sum += g[i].w * g[i].l;
        num += g[i].l;
    }

    int ans = 0;
    sort(g, g + n, cmp);
    for (int i = 0; i < n; i ++) //把i弄到最多
    {
        pre[i] = pre[i - 1] + g[i].r - g[i].l;
        prenum[i] = prenum[i - 1] + (g[i].r - g[i].l) * g[i].w;
    }
    for (int i = 0; i < n; i ++)
    {
        int nowsum = sum - g[i].l * g[i].w;
        int nownum = m - num + g[i].l;
        ans = max(ans, nowsum + pd(nownum, i));
    }
    cout << ans << "\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int T = 1;
    while (T --)
       solve();

}