#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 2e5 + 5;
int __ = 1, n = 0, m;
string s;
int valr[N], vall[N], vr[N];
struct ifo
{
    int l, r, w;
    bool operator<(const ifo &a) const
    {
        return w > a.w;
    }
} info[N];
int sumr = 0, suml = 0;
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> info[i].w >> info[i].l >> info[i].r;
        sumr += info[i].r;
        suml += info[i].l;
    }
    info[0] = {0, 0, 0};
    sort(info + 1, info + n + 1);
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ans += info[i].l * info[i].w;
        valr[i] = valr[i - 1] + info[i].r * info[i].w;
        vall[i] = vall[i - 1] + info[i].l * info[i].w;
        vr[i] = vr[i - 1] + info[i].r - info[i].l;
    }
    ans += (m - suml) * info[1].w;
    for (int i = 1; i <= n; i++)
    {
        if (sumr - info[i].r <= m)
        {
            ans = max(ans, (valr[i] - info[i].r * info[i].w) - info[i].w * (m - (sumr - info[i].r)));
            continue;
        }
        int l = 0, r = i - 1;
        while (l < r)
        {
            int mid = (l + r + 1) / 2;
            if (vr[mid] <= info[i].l)
                l = mid;
            else
                r = mid - 1;
        }
        int tans = 0;
        if (l + 1 < i)
            tans += (info[i].l - vr[l]) * info[l + 1].w;
        tans += valr[l] + (vall[n] - vall[l] - info[i].l * info[i].w);
        ans = max(ans, tans);
    }
    cout << ans << endl;
    return;
}
int32_t main()
{
#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    // cin >> __;
    while (__--)
        solve();
    return 0;
}