#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<cctype>
#include<vector>
#include<bitset>
#include<random>
#include<ctime>
#include<queue>
#include<cmath>
#include<list>
#include<map>
#include<set>
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long,long long>
#define FF fflush(stdout)
#define inf 0x3f3f3f3f
#define endl "\n"
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
//char buf[1<<20],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
inline ll read()
{
    ll s=0,f=1;
    char x=getchar();
    while(!isdigit(x))f=(x=='-'?-1:1),x=getchar();
    while(isdigit(x))s=s*10+x-'0',x=getchar();
    return s*f;
}
const int p=1e9+7;
//ll ksm(int a,int b){ll ans=1,bs=a;while(b){if(b&1)ans=ans*bs%p;bs=bs*bs%p;b>>=1;}return ans;}
mt19937 rd(time(0));
#define reaD read
struct hlydl{
    ll w,l,r;
}t[100005];
ll res[100005];
int main()
{
    int n=reaD();
    ll m=read();
    for(int i=1;i<=n;i++)
    {
        int w=reaD(),l=reaD(),r=reaD();
        t[i]=(hlydl){w,l,r};
    }
    sort(t+1,t+n+1,[](hlydl x,hlydl y){
        return x.w<y.w;
    });
    ll ans=0,anss=0;
    for(int i=1;i<=n;i++)
    ans+=t[i].l*t[i].w,m-=t[i].l;
    int now=n;
    for(int i=n;i>=1;i--)
    {
        ans-=t[i].l*t[i].w;
        m+=t[i].l;
        while(m&&now>i)
        {
            ll del=min(m,res[now]);
            res[now]-=del;
            m-=del;
            ans+=t[now].w*del;
            if(!res[now])now--;
        }
        anss=max(anss,ans+m*t[i].w);
        res[i]=t[i].r;
    }
    printf("%lld",anss);
    return 0;
}