#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>


#define ll              long long 
#define all(v)          v.begin(),v.end()
#define ld              long double
#define pll             std::pair<ll,ll>
#define pi              std::pair<int,int>
#define vi              std::vector<int>
#define vll             std::vector<ll>
#define len(x)          (int)x.size()
#define vec(T)          std::vector<T>

template<typename T, typename = void>
struct is_printable : std::false_type {};

template<typename T>
struct is_printable<T, std::void_t<decltype(std::declval<std::ostream&>() << std::declval<T>())>> : std::true_type {};
template <typename T>
void print(const std::pair<T, T>& pair) {
    std::cout << "(" << pair.first << ", " << pair.second << ")";
}

// General print function
template <typename T>
void print(const T& val) {
    std::cout << val;
}

// Print function for std::vector
template <typename T>
void print(const std::vector<T>& vec) {
    std::cout << '[';
    int n = vec.size();
    for (int i = 0; i < n; i++) {
        print(vec[i]);
        if (i < n - 1) {
            std::cout << ",";
        }
    }
    std::cout << ']' << '\n';
}

// Variadic template print function
template<typename T, typename... Args>
void print(const T& t, const Args&... args) {
    print(t);
    std::cout << (is_printable<T>::value ? ' ' : '\0');
    print(args...);
    if (sizeof...(args) == 1 && is_printable<T>::value) std::cout << '\n';

}

void solve() {
    ll n, m;
    std::cin >> n >> m;
    vll w(n), l(n), r(n), ind(n);
    std::iota(all(ind), 0);
    for (int i = 0; i < n; i++) {
        std::cin >> w[i] >> l[i] >> r[i];
    }
    std::sort(all(ind), [&](int i, int j) {return (w[i] > w[j]);});
    ll ans = 0, t = 0, suf = 0, pre = 0, psum = 0, ssum = 0;
    for (int i = n - 1; i > 0; i--) {
        ans += l[ind[i]] * w[ind[i]];
        t += l[ind[i]];
    }
    ans += (m - t) * w[ind[0]];
    for (int i = 0; i < n - 1; i++) {
        suf += l[ind[i]];
        ssum += l[ind[i]] * w[ind[i]];
    }
    for (int i = 0; i < n - 1; i++) {
        suf -= l[ind[i]];
        ssum -= l[ind[i]] * w[ind[i]];
        if (pre + suf + l[ind[i]] <= m && pre + suf + r[ind[i]] >= m) {
            ans = std::max(ans, psum + (m - pre - suf) * w[ind[i]] + ssum);
            break;
        }
        psum += r[ind[i]] * w[ind[i]];
        pre += r[ind[i]];
    }
    if (pre < m) {
        ans = std::max(ans, psum + (m - pre) * w[ind[n - 1]]);
    }
    std::cout << ans << '\n';
}



int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t = 1;
    //std::cin >> t;
    while (t--) solve();
    return 0;
}