#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
using i64 = long long;
using arr = array<int, 3>;

const int N = 1e6 + 10;
const int R = 1e6;
struct segtree {
i64 tree[N << 2];
void update(int pos, i64 k, int l = 1, int r = R, int p = 1) {
    if (l == r) {
        tree[p] += k;
        return;
    }
    int mid = l + r >> 1;
    if (mid >= pos) {
        update(pos, k, l, mid, p << 1);
    } else {
        update(pos, k, mid + 1, r, p << 1 | 1);
    }
    tree[p] = tree[p << 1] + tree[p << 1 | 1];
}
i64 query(int l, int r, int nl = 1, int nr = R, int p = 1) {
    if (l <= nl && r >= nr) {
        return tree[p];
    }
    int mid = nl + nr >> 1;
    i64 ans = 0;
    if (mid >= l) {
        ans += query(l, r, nl, mid, p << 1);
    }
    if (mid < r) {
        ans += query(l, r, mid + 1, nr, p << 1 | 1);
    }
    return ans;
}
int Query(int l, int r, int k, int nl = 1, int nr = R, int p = 1) {
    if (tree[p] >= k) {
        return l;
    }
    int mid = nl + nr >> 1;
    if (tree[p << 1 | 1] >= k) {
        return Query(l, r, k - tree[p << 1 | 1], nl, mid, p << 1);
    } else {
        return Query(l, r, k, mid + 1, nr, p << 1 | 1);
    }
}
}Tw, Tsum;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n, m;
    cin >> n >> m;
    int now = m;
    i64 Sum = 0;
    vector<arr> v(n);
    for (auto &[w, l, r] : v) {
        cin >> w >> l >> r;
        now -= l;
        Sum += 1LL * w * l;
        Tw.update(w, 1LL * (r - l) * w);
        Tsum.update(w, r - l);
    }
    // cerr << now << " " << Sum << endl;
    i64 ans = 0, sum = 0;
    for (auto &[w, l, r] : v) {
        now += l;
        sum = Sum - 1LL * w * l;
        // cerr << now << " " << sum << endl;
        int x = Tsum.query(w + 1, R);
        if (x >= now) {
            int xx = Tsum.Query(w + 1, R, now);
            sum += Tw.query(xx, R) + 1LL * (now - Tsum.query(xx, R)) * (xx - 1);
        } else {
            sum += Tw.query(w + 1, R) + 1LL * (now - x) * w;
        }
        // cerr << sum << endl;
        ans = max(ans, sum);
        now -= l;
    }
    cout << ans << endl;
    return 0;
}