#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	long long y, z; cin >> y >> z;
	struct clx {
		long long c, l, x;
		int index;
	};
	vector<clx>in;
	rep(i, n) {
		long long c, l, x; cin >> c >> l >> x;
		if (l >= z)continue;
		in.push_back({ c,l,x,-1 });
	}
	n = in.size();
	std::sort(in.begin(), in.end(), [](clx l, clx r) {
		return l.l < r.l; }
	);
	rep(i, n)in[i].index = i;
	long long ans = 0;
	priority_queue<pair<long long, int>>pq;
	int idx = 0;
	rep(i, n) {
		if (in[i].l < y) {
			pq.push({ in[i].x,i });
			idx = i + 1;
		}
	}
	rep2(i, idx, n) {
		while (!pq.empty() && y < in[i].l) {
			auto[x, idx] = pq.top();
			long long use = (in[i].l - y + x - 1) / x;
			use = min(use, in[idx].c);
			in[idx].c -= use;
			ans += use;
			y += use * x;
			if (in[idx].c == 0)pq.pop();
		}
		pq.push({ in[i].x,i });
		//cout << ans << endl;
		if (y < in[i].l) {
			cout << -1 << endl;
			return 0;
		}
	}
	while (!pq.empty() && y < z) {
		auto[x, idx] = pq.top();
		long long use = (z - y + x - 1) / x;
		use = min(use, in[idx].c);
		in[idx].c -= use;
		ans += use;
		y += use * x;
		if (in[idx].c == 0)pq.pop();
	}
	if (y < z)cout << -1 << endl;
	else cout << ans << endl;
	//cout << "debug" << y << " " << ans << endl;
	return 0;
}