#include using namespace std; int main(void){ long long n,y,z; cin>>n>>y>>z; vector>v(n); priority_queue>pq; for(int i=0;i>v[i][1]>>v[i][0]>>v[i][2]; } v.push_back({z,-1,-1}); long long ans=0; sort(v.begin(),v.end()); int it=0; for(int i=0;i=pq.top()[1]){ y+=pq.top()[0]*pq.top()[1]; ans+=pq.top()[1]; pq.pop(); }else{ auto x=pq.top(); pq.pop(); pq.push({x[0],x[1]-tmp}); ans+=tmp; y+=tmp*pq.top()[0]; } if(y>=z)break; while(v[it][0]<=y){ pq.push({v[it][2],v[it][1]}); it++; } } cout<<(y