#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define root 1,n,1
#define ls (rt<<1)
#define rs (rt<<1|1)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define pd __gnu_pbds
inline ll read() {
	ll x=0,w=1;char ch=getchar();
	for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') w=-1;
	for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
	return x*w;
}
inline void print(__int128 x){
	if(x<0) {putchar('-');x=-x;}
	if(x>9) print(x/10);
	putchar(x%10+'0');
}
#define maxn 1000010
#define int long long 
const double eps=1e-8;
#define	int_INF 0x3f3f3f3f
#define ll_INF 0x3f3f3f3f3f3f3f3f
struct Node{
	int w,l,r;
	bool operator < (const Node &rhs) const {
		return w>rhs.w;
	}
}node[maxn];
int lowbit(int x) {
	return x&-x;
}
int tree[maxn];int limit=2e5;
void Add(int pos,int val) {
	while(pos<=limit) {
		tree[pos]+=val;
		pos+=lowbit(pos);
	}
}
int Query(int pos) {
	int ans=0;
	while(pos) {
		ans+=tree[pos];
		pos-=lowbit(pos);
	}
	return ans;
}
int lsum1[maxn],lsum2[maxn];int lsum3[maxn];
signed main() {
	int n=read();int m=read();
	int sum=0;int sum2=0;
	for(int i=1;i<=n;i++) {
		node[i].w=read();node[i].l=read();node[i].r=read();
		sum+=node[i].l;
		sum2+=node[i].l*node[i].w;
	}
	sort(node+1,node+n+1);
	for(int i=1;i<=n;i++) {
		Add(i,node[i].r-node[i].l);
		lsum1[i]=lsum1[i-1]+node[i].l*node[i].w;
		lsum2[i]=lsum2[i-1]+node[i].r*node[i].w;
	}
	int ans=-1;
	ans=max(ans,sum2+node[1].w*(m-sum));
	for(int i=1;i<=n;i++) {
		int opt=m-sum+node[i].l;
		if(opt>=Query(i-1)) {
			ans=max(ans,lsum2[i-1]+lsum1[n]-lsum1[i]+(opt-Query(i-1))*node[i].w);
		}
		else {
			int l=1,r=i-1;int pos=-1;
			while(l<=r) {
				int mid=(l+r)>>1;
				if(opt>=Query(mid)) {
					pos=mid;
					l=mid+1;
				}
				else {
					r=mid-1;
				}
			}
			if(pos==-1) {
				ans=max(ans,lsum1[n]-node[i].l*node[i].w+opt*node[1].w);
			}
			else {
//				if(pos>=i) {
//					ans=max(ans,lsum2[i-1]+lsum1[n]-lsum1[i]+(opt-Query(i-1))*node[i].w);
//					ans=max(ans,lsum2[pos-1]-node[i].r*node[i].w+lsum1[n]-lsum1[pos]+(opt-Query(pos-1))*node[pos].w);
//				}
				ans=max(ans,lsum2[pos-1]+lsum1[n]-lsum1[pos-1]-node[i].l*node[i].w+(opt-Query(pos-1))*node[pos].w);
			}
		}
//		cout<<i<<" "<<ans<<endl;
	}
	cout<<ans<<endl;
	return 0;
}