#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
using i64 = long long;
const int inf = 1e18;
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<tuple<int, int, int>> a(n + 1);
    for (int i = 1, w, l, r; i <= n; i++)
    {
        cin >> w >> l >> r;
        a[i] = make_tuple(w, l, r);
    }
    sort(a.begin() + 1, a.end(), [](auto &x, auto &y)
         { return get<0>(x) != get<0>(y) ? get<0>(x) > get<0>(y) : get<2>(x) > get<2>(y); });
    vector<int> pre(n + 1), suf(n + 2);
    vector<int> presum(n + 1), sufsum(n + 2);
    for (int i = 1; i <= n; i++)
    {
        pre[i] = pre[i - 1] + get<2>(a[i]);
        presum[i] += presum[i - 1] + get<0>(a[i]) * get<2>(a[i]);
    }
    for (int i = n; i >= 1; i--)
    {
        suf[i] = suf[i + 1] + get<1>(a[i]);
        sufsum[i] = sufsum[i + 1] + get<0>(a[i]) * get<1>(a[i]);
    }
    int mx = 0;
    for (int i = 1; i <= n; i++)
    {
        if (pre[i - 1] + suf[i + 1] > m)
        {
            int L = 1, R = i - 1, ans = -1;
            auto check = [&](int mid) -> bool
            {
                int res = pre[mid] + suf[mid + 1] - get<1>(a[i]);
                return res <= m;
            };
            while (L <= R)
            {
                int mid = L + R >> 1;
                if (check(mid))
                    ans = mid, L = mid + 1;
                else
                    R = mid - 1;
            }
            int res = 0;
            res = sufsum[ans + 1] - get<0>(a[i]) * get<1>(a[i]) + presum[ans] + (m - pre[ans] - suf[ans + 1]) * get<0>(a[ans + 1]);
            mx = max(mx, res);
        }
        else
            mx = max(mx, presum[i - 1] + sufsum[i + 1] + (m - pre[i - 1] - suf[i + 1]) * get<0>(a[i]));
    }
    cout << mx << endl;
}

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