#include <iostream>      // cout, endl, cin
#include <string>        // string, to_string, stoi
#include <vector>        // vector
#include <algorithm>     // min, mai, swap, sort, reverse, lower_bound, upper_bound
#include <utility>       // pair, make_pair
#include <tuple>         // tuple, make_tuple
#include <cstdint>       // int64_t, int*_t
#include <cstdio>        // printf
#include <map>           // map
#include <queue>         // queue, priority_queue
#include <set>           // set
#include <stack>         // stack
#include <deque>         // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset>        // bitset
#include <cctype>        // isupper, islower, isdigit, toupper, tolower
#include <iomanip>       // fiied,setprecision
#include <limits.h>      // INT_MAi
#include <math.h>        // M_PI
#include <random>        // random_device, mt19937, uniform_int_distribution
#include <regex>         // 正規表現
#include <time.h>        // time
#include <fstream>       // ifstream, ofstream
#include <array>         // array
#include <bit>           // bit
#include <chrono>        // chrono
#include <span>          // span
#include <cmath>         // sqrt, sin, cos, tan, asin, acos, atan, atan2
#include <complex>       // 複素数
// #include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;
// using mint = modint1000000007;
using mint = modint998244353;
//using mint =modint10007;
using ll = long long;
using ull = unsigned long long;
using ld = long double; // 80bit 18桁

#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const string DIR = "URDL";
const int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dy8[8] = {1, 1, 0, -1, -1, -1, 0, 1};

// INFに3以上を掛ける、またはint(INF)に1以上を足すとオーバーフローする
// 4611686016279904255 cf: LLONG_MAi=9223372036854775807
const ll INF = (1ll << 62) - (1ll << 31) - 1ll;

struct slime{
    ll c,x,l;
    bool operator<(const slime& a) const {
        return l < a.l;
        return x > a.x;
        return c > a.c;
    }
    //slime (ll c,ll x,ll l):c(c),x(x),l(l){}
};
int main(){
    int n,y,z;
    cin>>n>>y>>z;
    vector<slime>s(n);
    rep(i,n){
        ll c1,l1,x1;
        cin>>c1>>l1>>x1;
        s[i].c=c1;
        s[i].l=l1;
        s[i].x=x1;
    }
    if(!s.size()>0)sort(s.begin(),s.end());
    ll now=y;
    priority_queue<slime> q;
    int i=0;
    ll ans=0;
    ll next=0;
    while(i<n||!q.empty()){
        while(s[i].l<=now){
            q.push(s[i]);
            i++;
        }
        if(i<n)next=s[i].l;
        else next=z;
        bool ok=false;
        while(!q.empty()){
            auto y=q.top();q.pop();
            int count=max(0ll,min(y.c,(next-now+y.x-1)/y.x));
            now+=count*y.x;
            ans+=count;
            ok=true;
            //cerr<<"y.c:"<<y.c<<"count: "<<count<<" y.x: "<<y.x<<" now:"<<now<<" ans:"<<ans<<endl;
            if(y.c-count>0){
                slime g=y;
                g.c=y.c-count;
                g.l=y.l;
                g.x=y.x;
                q.push(g);
            }
            break;
        }
        if(ok==false)break;
        if(now>=z)break;
    }
    if(now>=z)cout<<ans<<endl;
    else cout<<-1<<endl;
    return 0;
}