#include <bits/stdc++.h>
using namespace std;

int main(void){
    int n;
    long long y,z;
    cin>>n>>y>>z;
    priority_queue<pair<long long,pair<long long,long long>>>pq1;
    priority_queue<pair<long long,long long>>pq2;
    for(int i=0;i<n;i++){
        long long c,l,x;
        cin>>c>>l>>x;
        if(l<z)pq1.push({-l,{c,x}});
    }
    long long next=-pq1.top().first;
    while(!pq1.empty()){
        if(next<=y){
            pq2.push({pq1.top().second.second,pq1.top().second.first});
            pq1.pop();
            if(!pq1.empty()){
                next=-pq1.top().first;
            }else{
                next=z+1;
            }
        }else{
            break;
        }
    }
    long long sum=0;
    while(!pq2.empty()){
        long long xd=pq2.top().first,cd=pq2.top().second;
        if(next>z){
            if((z-y-1)/xd+1>=cd){
                y+=xd*cd;
                sum+=cd;
                pq2.pop();
            }else{
                sum+=(z-y-1)/xd+1;
                cout<<sum<<endl;
                return 0;
            }
        }else{
            if((next-y-1)/xd+1>=cd){
                y+=xd*cd;
                sum+=cd;
                pq2.pop();
            }else{
                sum+=(next-y-1)/xd+1;
                y+=((next-y-1)/xd+1)*xd;
                pq2.pop();
                pq2.push({xd,cd-((next-y-1)/xd+1)});
                if(y>=z){
                    cout<<sum<<endl;
                    return 0;
                }else{
                    while(!pq1.empty()){
                        if(next<=y){
                            pq2.push({pq1.top().second.second,pq1.top().second.first});
                            pq1.pop();
                            if(!pq1.empty()){
                                next=-pq1.top().first;
                            }else{
                                next=z+1;
                            }
                        }else{
                            break;
                        }
                    }
                }
            }
        }
        //cout<<y<<" "<<sum<<" "<<pq2.top().first<<" "<<pq2.top().second<<endl;
    }
    cout<<-1<<endl;
    return 0;
}