#include<bits/stdc++.h>
using i128 = __int128;

std::ostream &operator<<(std::ostream &os, i128 n) {
    std::string s;
    while (n) {
        s += '0' + n % 10;
        n /= 10;
    }
    std::reverse(s.begin(), s.end());
    return os << s;
}

using namespace std;

#define ull unsigned long long
#define ll long long
#define lowbit(x) (x)&(-x)
#define int long long
// #define int i128
// #define ll i128
//#define double long double 
const int N = 1e3 + 5;
const ll base = 131;
const ll mod = 998244353;
struct syz{
    int a,b,c;
    syz(){}
    syz(int aa,int bb,int cc):a(aa),b(bb),c(cc)
    {}
    bool operator <(syz x){
        if(this->a==x.a){
            return this->b<x.b;
        }
        return this->a>x.a;
    }
};
void solve() {
    int n;
    ll m;
    cin>>n>>m;
    vector<syz>w(n+1);
    for(int i=1;i<=n;++i) cin>>w[i].a>>w[i].b>>w[i].c;
    sort(w.begin()+1,w.end());
    i128 sum=0,ma=0;
    for(int i=1;i<=n;++i){
        sum=sum+w[i].a*(w[i].b);
        m-=w[i].b;
    }
    ma=sum+m*w[1].a;
    m=w[n].b+m;
    //cerr<<ma<<'\n';
    sum-=w[n].b*w[n].a;
    for(int i=1;i<n;++i){
        if(m<w[i].c-w[i].b){
            sum+=m*w[i].a;
            m=0;
            break;
        }
        else sum+=(w[i].c-w[i].b)*w[i].a,m-=(w[i].c-w[i].b);
    }
    if(m) sum+=m*w[n].a;
    cout<<max(ma,sum);

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