#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 1e6 + 10;

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

int sum[N];
int cnt[N];
int n;
int m;

int get(int x, int r) {
    int l = 1;
    int ans = 0;

    while (l <= r) {
        int mid = (l + r) / 2;

        if (cnt[mid] <= x) {
            ans = mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }

    return ans;
}

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

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

    sort(a + 1, a + 1 + n, [](node x, node y) {
        return x.w > y.w;
    });

    int tot = 0, res = 0;

    for (int i = 1; i <= n; i++) {
        tot += a[i].w * a[i].l;
        m -= a[i].l;
        sum[i] = (a[i].r - a[i].l) * a[i].w;
        cnt[i] = a[i].r - a[i].l;
    }

    for (int i = 2; i <= n; i++) {
        sum[i] += sum[i - 1];
        cnt[i] += cnt[i - 1];
    }

    for (int i = 1; i <= n; i++) {
        int cur = m + a[i].l;
        int p = get(cur, i - 1);//因为是完全不种植第i种植物，所以我们只能看第i种前面的，因为后面的一定不优
        cur -= cnt[p];
        int t = tot - a[i].l * a[i].w + sum[p];
        int j = i + 1;
        while (j <= n && cur) {
            t += min(cur, a[j].r - a[j].l) * a[j].w;
            cur -= min(cur, a[j].r - a[j].l);
            j  ++;
        }
        // cout << "p = " << p << ' ' << "cur = " << cur << " " << "t = " << t << endl;
        res = max(res, t);
    }
 
    cout << res << endl;
}

signed main() {
    solve();
}