https://www.acwing.com/blog/content/30297/

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int a[N], t[N], b[N];
int main() {
    int n;
    cin >> n;
    for(int i = 0; i < n; i ++){
        cin >> a[i] >> t[i] >> b[i];
    } 
    int times = 1; 
    for(int i = 0; i < n; i ++) {
        int start = a[i];
        int max_wait = b[i];
        int duration = times - start;
        if(duration > max_wait) {
            cout << -1 << " ";
            continue;
        }
        cout << times << " ";
        times += t[i];

    }
    return 0;

}