// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cassert>
#include <functional>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951ll
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl


int main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N,Y,Z;
    cin >> N >> Y >> Z;
    vector<array<ll,3>> LXC(N);
    REP(i,N){
        ll c,l,x;
        cin >> c >> l >> x;
        LXC[i] = {l,x,c};
    }

    sort(ALL(LXC),greater<>());

    priority_queue<pair<ll,ll>> XC;

    // 現在の自分のレベル以下を全て入れる
    while(!LXC.empty()){
        array<ll,3> lxc = LXC.back();
        if(lxc[0]<=Y){
            XC.push({lxc[1],lxc[2]});
            LXC.pop_back();
        }else{
            break;
        }
    }

    ll Ans = 0;
    while(Y<Z){

        // cout << "!" MM Y MM Z MM Ans << endl;

        if(XC.empty()){
            cout << -1 << endl;
            return 0;
        }

        ll x = XC.top().first, c = XC.top().second;
        XC.pop();

        ll lim = Z-Y;
        if(!LXC.empty()){
            ll tmp = LXC.back()[0] - Y;
            lim = min(tmp,lim);
        }

        ll U = c;
        if((lim+x-1)/x < c){
            U = (lim+x-1)/x;
        }

        Y += x*U;
        Ans += U;
        c -= U;

        if(c>0){
            XC.push({x,c});
        }

        while(!LXC.empty()){
            array<ll,3> lxc = LXC.back();
            if(lxc[0]<=Y){
                XC.push({lxc[1],lxc[2]});
                LXC.pop_back();
            }else{
                break;
            }
        }

    }

    cout << Ans << endl;

    return 0;
    
}