#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename T>bool chmax(T &x, T y){if(x>=y)return false;x=y;return true;}
template<typename T>bool chmin(T &x, T y){if(x<=y)return false;x=y;return true;}

int main(){
  long long N, Y, Z, ans = 0;
  auto ret = [&](){
    cout << ans << endl;
  };
  cin >> N >> Y >> Z;
  vector<vector<long long>> v(N, vector<long long> (3));
  rep(i, N)cin >> v[i][0] >> v[i][1] >> v[i][2];
  sort(v.begin(), v.end(), [](const vector<long long> &a, const vector<long long> &b){return a[1]<b[1]||a[1]==b[1]&&a[2]>b[2];});
  map<long long, long long> m;
  for(int i = 0; i < N;){
    if(Y>=Z){
      ret();
      return 0;
    }
    if(v[i][1]>Y)break;
    m[-v[i][1]] += v[i][0];
    if(i<N-1&&v[i+1][1]<=Y){
      i++;
    }else{
      if(!m.size())break;
      Y -= (*m.begin()).first;
      m[(*m.begin()).second]--;
      ans++;
      if((*m.begin()).second==0)m.erase(m.begin());
    }
  }
  for(auto x: m){
    if((Z-Y-x.first-1)%(-x.first)>x.second){
      Y -= x.first*x.second;
      ans += x.second;
    }else{
      ans += (Z-Y-x.first-1)%(-x.first);
      ret();
      return 0;
    }
  }
  if(Y>=Z){
    ret();
    return 0;
  }
  cout << -1 << endl;
}