A8383 | Polycarpus and Tasks

The first line of the input contains a single integer $n$ ( $1<=n<=10^{5}$ ) — the number of tasks in set $A$ .

Then $n$ lines describe the tasks. The $i$ -th line contains three space-separated integers $l_{i}$ , $r_{i}$ , $t_{i}$ ( $1<=l_{i}<=r_{i}<=10^{9}$ , $1<=t_{i}<=r_{i}-l_{i}+1$ ) — the description of the $i$ -th task.

It is guaranteed that for any tasks $j,k$ (considering that $j<k$ ) the following is true: $l_{j}<l_{k}$ and $r_{j}<r_{k}$ .

For each task $i$ print a single integer — the result of processing task $i$ on the $i$ -th iteration of the cycle (step 3) in function $f(A)$ . In the $i$ -th line print:

- 0 — if you managed to add task $i$ on step 4.
- -1 — if you didn't manage to add or replace task $i$ (step 7).
- $res_{i}$ ( $1<=res_{i}<=n$ ) — if you managed to replace the task (step 6): $res_{i}$ equals the task number (in set $A$ ), that should be chosen as $b_{k}$ and replaced by task $a_{i}$ .

无