#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

template<typename T> vector<T> make_vector(size_t sz){
	return vector<T>(sz);
}

template<typename T,typename... Ts> 
auto make_vector(size_t sz, Ts... ts){
	return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}

template<typename T,typename U,typename... V> 
typename enable_if<is_same<T, U>::value!=0>::type 
fill_value(U &u, const V... v){
	u=U(v...);
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_value(U &u, const V... v){
	for(auto &e:u){
		fill_value<T>(e,v...);
	}
}



const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

const pid_t pid = getpid();
// Problem Specific Parameter:

ll n, x;
const int limit = 100010;
ll b[limit], l[limit], u[limit];
ll init_val;

vector<int> ord, pos;
vector<ll> csum;

void init(){
	ord = vector<int>(n);
	iota(begin(ord), end(ord), 0);	

	auto cmp = [&](int i, int j) {
		const ll ci = 1LL * u[i] * (x - b[i]) + 1LL * l[i] * b[i];
		const ll cj = 1LL * u[j] * (x - b[j]) + 1LL * l[j] * b[j];
		return ci < cj;
	};	

	sort(rbegin(ord), rend(ord), cmp);
	
	pos = vector<int>(n);
	rep(i, n) pos[ord[i]] = i;

	csum = vector<ll>(n + 1, 0LL);
	rep(i, n){
		const int p = ord[i];
		csum[i + 1] += csum[i];
		csum[i + 1] += 1LL * u[p] * (x - b[p]) + 1LL * l[p] * b[p];
	}
}

bool check(ll k){
	rep(i, n){
		const ll p = k / x;
		const ll q = k % x;

		const ll xval = 1LL * u[i] * (x - b[i]) + 1LL * l[i] * b[i];
		const ll qval = 1LL * u[i] * max(q - b[i], 0LL) + 1LL * l[i] * min(q, b[i]);

		if(q == 0){
			if(init_val + csum[p] >= 0) return true;
		} else if(p < pos[i]){
			if(init_val + csum[p] + qval >= 0) return true;
		} else {
			if(init_val + csum[p + 1] - xval + qval >= 0) return true;
		}
	}

	return false;
}

int main(void){
	cin >> n >> x;
	rep(i, n) cin >> b[i] >> l[i] >> u[i];

	init_val = 0LL;
	rep(i, n) init_val -= 1LL * l[i] * b[i];

	init();

	ll low = -1LL, high = n * x;

	while(high - low > 1){
		const ll mid = (low + high) / 2LL;
		if(check(mid))
			high = mid;
		else
			low = mid;
	}

	cout << high << endl;
	return 0;
}

Measured memory_bytes: 4096