#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
using namespace std;
ll read(){
    ll X = 0 ,r = 1;
    char ch = getchar();
    while(!isdigit(ch) && ch != '-') ch = getchar();
    if(ch == '-') r = -1,ch = getchar();
    while(isdigit(ch)) X = X*10+ch-'0',ch = getchar();
    return X*r;
}
const int N = 1e5+10;
int n; ll m,ans;
struct node{
    ll w,l,r;
}a[N];
void solve(){
    n = read(); m = read();
    for(int i=1;i<=n;i++){
        ll w = read(),l = read(),r = read();
        a[i] = node{w,l,r};
    }
    ll sum1 = 0,sum2 = 0;
    sort(a+1,a+1+n,[](node x,node y){return x.w == y.w ? x.l < y.l : x.w > y.w;});
    ll rest = m;
    for(int i=1;i<=n;i++){
        sum1 += a[i].l*a[i].w;
        rest -= a[i].l;
    }
    sum1 += rest*a[1].w;
    rest = m;
    for(int i=1;i<n;i++){
        sum2 += a[i].l*a[i].w;
        rest -= a[i].l;
    }
    for(int i=1;i<n;i++){
        a[i].r -= a[i].l;
        if(a[i].r <= rest) sum2 += a[i].r*a[i].w,rest -= a[i].r;
        else {
            sum2 += rest*a[i].w,rest = 0;
            break;
        }
    }
    sum2 += rest*a[n].w;
    cout << max(sum1,sum2) << "\n";
}
signed main(){
    int T = 1;
    while(T--) solve();
    return 0;
}