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

int n, m, w, l, r;
int a[100005][3]{};
int seg[400005]{};

// idx번째 노드가 나타내는 구간이 st에서 en이고, l부터 r까지의 합을 구하고 싶다
int sum(int idx, int st, int en, int l, int r) {
    if(l > en || r < st) {
        return 0;
    } else if (l <= st && en <= r) {
        return seg[idx];
    } else {
        return sum(idx * 2, st, (st + en) / 2, l, r) + sum(idx * 2 + 1, (st + en) / 2 + 1, en, l, r);
    }
}

// idx번째 노드가 나타내는 구간이 st에서 en이고 i번재 원소를 diff만큼 변화시키고 싶다
void update(int idx, int st, int en, int i, int diff) {
    if (i >= st && i <= en) {
        seg[idx] += diff;
        if (st == en) {
            return;
        }
        if (i <= (st + en) / 2) {
            update(idx * 2, st, (st + en) / 2, i, diff);
        } else {
            update(idx * 2 + 1, (st + en) / 2 + 1, en, i, diff);
        }
    }
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    vector<vector<int>> vec(n, vector<int>(3));
    
    for (int i = 0; i < n; i++) {
        cin >> w >> l >> r;
        vec[i][0] = w;
        vec[i][1] = l;
        vec[i][2] = r;
    }

    sort(vec.begin(), vec.end(), [](const vector<int>& o1, const vector<int>& o2) {
        return o1[0] > o2[0];
    });

    vector<int> usedTime(n);
    vector<int> remainingTime(n);
    int total = 0;

    for (int i = 0; i < n; i++) {
        usedTime[i] = vec[i][2];
        total += vec[i][2];
    }

    for (int i = n - 1; total > m && i >= 0; i--) {
        usedTime[i] = max(vec[i][1], usedTime[i] - (total - m));
        total -= (vec[i][2] - usedTime[i]);
        remainingTime[i] = (vec[i][2] - usedTime[i]);
    }

    vector<int> prefixSum(n);
    vector<int> prefixSum_2(n);
    prefixSum[0] = remainingTime[0];
    prefixSum_2[0] = remainingTime[0] * vec[0][0];

    for (int i = 1; i < n; i++) {
        prefixSum[i] = prefixSum[i - 1] + remainingTime[i];
        prefixSum_2[i] = prefixSum_2[i - 1] + remainingTime[i] * vec[i][0];
    }

    int answer = 0;
    int lSum = 0;
    for (int i = n - 1; i > 0; i--) {
        answer += (vec[i][0] * vec[i][1]);
        lSum += vec[i][1];
    }
    answer += (vec[0][0] * (m - lSum));

    // cout << "usedTime:: ";
    // for (int i = 0; i < n; i++) {
    //     cout << usedTime[i] << " ";
    // }
    // cout << endl;
    // cout << "remainingTime:: ";
    // for (int i = 0; i < n; i++) {
    //     cout << remainingTime[i] << " ";
    // }
    // cout << endl;
    // cout << "prefixSum:: ";
    // for (int i = 0; i < n; i++) {
    //     cout << prefixSum[i] << " ";
    // }
    // cout << endl;
    // cout << "prefixSum_2:: ";
    // for (int i = 0; i < n; i++) {
    //     cout << prefixSum_2[i] << " ";
    // }
    // cout << endl;
    
    int haha = 0;

    for (int i = 0; i < n; i++) {
        haha += usedTime[i] * vec[i][0];
    }

    // cout << "haha :: " << haha << endl;

    for (int i = n - 1; i > 0; i--) {
        int time = usedTime[i];
        int addVal = -1 * usedTime[i] * vec[i][0];

        if (prefixSum[i - 1] <= 0) {
            continue;
        } else if (prefixSum[i - 1] <= time) {
            addVal += prefixSum_2[i - 1];
            time -= prefixSum[i - 1];

            if (time > 0) {
                int idx = lower_bound(prefixSum.begin() + i + 1, prefixSum.end(), time + prefixSum[i]) - prefixSum.begin();
                // cout << time << endl;
                // cout << "  idx :: " << idx << endl;
                if (idx == n) {
                    addVal += prefixSum_2[n - 1] - prefixSum_2[i];
                    addVal += (vec[i][0] * (time - (prefixSum[n - 1] - prefixSum[i])));
                } else if (prefixSum[idx] == time + prefixSum[i]) {
                    addVal += (prefixSum_2[idx] - prefixSum_2[i]);
                } else {
                    if (idx - 1 > i) { 
                        addVal += prefixSum_2[idx - 1];
                        time -= (prefixSum[idx - 1] - prefixSum[i]);
                    }
                    addVal += vec[idx][0] * time;
                }
            }
        } else {
            int idx = lower_bound(prefixSum.begin(), prefixSum.begin() + i, time) - prefixSum.begin();
            // cout << "idx:: " << idx << endl;
            if (prefixSum[idx] == time) {
                addVal += prefixSum_2[idx];
            } else {
                if (idx - 1 >= 0) { 
                    addVal += prefixSum_2[idx - 1];
                    time -= prefixSum[idx - 1];
                }
                addVal += vec[idx][0] * time;
            }
        }
        // cout << i << ":: " << haha + addVal << endl;
        answer = max(answer, haha + addVal);
    }

    cout << answer << endl;
}