#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->b<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());
    vector<int>pre(n+1),presum(n+1);
    for(int i=1;i<=n;++i) pre[i]=pre[i-1]+w[i].c-w[i].b,presum[i]=presum[i-1]+(w[i].c-w[i].b)*w[i].a;
    ll ma=0,sum=0,Sum=0;
    for(int i=1;i<=n;++i){
        sum+=w[i].b;
        Sum+=w[i].b*w[i].a;
    }
    ma=max(ma,Sum+(m-sum)*w[1].a);
    for(int i=n;i>=1;--i){
        //ma=max(ma,Sum+(m-sum)*w[i].a);
        int res=m-sum+w[i].b;
        if(res<pre[i-1]){
            auto now=upper_bound(pre.begin()+1,pre.end(),res)-pre.begin()-1;
            ma=max(ma,Sum-w[i].b*w[i].a+presum[now]+(res-pre[now])*w[i].a);
        }
        else {
            int rest=res-pre[i-1];
            ma=max(ma,Sum-w[i].b*w[i].a+rest*w[i].a+presum[i-1]);
        }
        // auto now=upper_bound(pre.begin()+1,pre.end(),res)-pre.begin()-1;
        // ma=max(ma,Sum-w[i].b*w[i].a+presum[now]+(res-pre[now])*w[i].a);
    }
    cout<<ma<<'\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) solve();
}