#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll Y,Z;
multiset<array<ll,3>> cand;
map<ll,ll> M;


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>Y>>Z;
	FOR(i,N) {
		ll C,L,X;
		cin>>C>>L>>X;
		if(L<=Y) {
			M[X]+=C;
		}
		else {
			cand.insert({L,X,C});
		}
	}
	ll num=0;
	while(Y<Z) {
		if(cand.size()&&(*cand.begin())[0]<=Y){
			M[(*cand.begin())[1]]+=(*cand.begin())[2];
			cand.erase(cand.begin());
			continue;
		}
		if(M.empty()) {
			cout<<-1<<endl;
			return;
		}
		if(M.rbegin()->second==0) {
			M.erase(M.rbegin()->first);
			continue;
		}
		ll tar=Z;
		if(cand.size()) tar=min(tar,(*cand.begin())[0]);
		ll step=M.rbegin()->first;
		ll add=min(M.rbegin()->second,(tar-Y+step-1)/step);
		Y+=add*step;
		M[step]-=add;
		num+=add;
		
	}
	cout<<num<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}