#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define lowbit(x) (x)&(-x)
#define int long long
//#define double long double 
const int N = 1e6 + 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->c-this->b)>x.c-x.b;
        }
        return this->a>x.a;
    }
};
void solve() {
    int n,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());
    //cerr<<w[1].a<<'\n';
    ll ma=0,mm=m;
    for(int i=2;i<=n;++i){
        mm-=w[i].b;
        ma+=w[i].b*w[i].a;
    }
    ma+=mm*w[1].a;
    //cerr<<ma<<'\n';
    ll ans=0;
    //cerr<<m<<'\n';
    for(int i=1;i<n;++i){
        ans+=w[i].b*w[i].a;
        m-=w[i].b;
    }
    //cerr<<ans<<'\n';
    for(int i=1;i<=n;++i){
        if(m<=w[i].c-w[i].b){
           ans+=m*w[i].a;
           break;
        }
        else ans+=(w[i].c-w[i].b)*w[i].a,m-=(w[i].c-w[i].b);
    }
    //cerr<<ans<<'\n';
    cout<<max(ans,ma)<<'\n';

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