#include <bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define lowbit(x) (x & (-x))
typedef pair<int, int> PII;
const int INF = 1e18;
const int N = 1e5 + 10;
struct node
{
    int w, l, r, now;
};
node a[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    int sum = 0, ma = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].w >> a[i].l >> a[i].r;
        ma = max(ma, a[i].l);
        sum += a[i].l;
    }
    sort(a + 1, a + n + 1, [&](node x, node y)
         { return x.w < y.w; });
    int u = 0, now = 0;
    for (int i = n; i > 0; i--)
    {
        sum += a[i].r;
        sum -= a[i].l;
        if (sum > m)
        {
            u = i;
            now = m - now + a[i].l;
            break;
        }
        now = sum;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        if (i < u)
            ans += a[i].w * a[i].l, a[i].now = a[i].l;
        else if (i == u)
            ans += now * a[i].w, a[i].now = now;
        else
            ans += a[i].w * a[i].r, a[i].now = a[i].r;
    }
    int p = ans, ans2 = ans;
    vector<int> v(ma + 1);
    int tot = 0;
    for (int i = u; i > 0; i--)
    {
        int l = a[i].now, r = a[i].r;
        while (l < r)
        {
            v[++tot] = v[tot] + a[i].w;
            l++;
            if (tot > ma)
                break;
        }
        if (tot > ma)
            break;
    }
    for (int i = 1; i < u; i++)
    {
        p = ans2;
        p -= a[i].now * a[i].w;
        p += v[a[i].now];
        ans = max(ans, p);
    }
    int ans1 = 0, sum1 = 0;
    for (int i = 1; i < n; i++)
    {
        ans1 += a[i].l * a[i].w;
        sum1 += a[i].l;
    }
    ans1 += (m - sum) * a[n].w;
    ans = max(ans, ans1);
    cout << ans << '\n';
}
int T = 1;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // cin >> T;
    while (T--)
        solve();
    return 0;
}