Distributing Candies

Aunty Khong is preparing $n$ boxes of candies for students from a nearby school. The boxes are numbered from $0$ to $n - 1$ and are initially empty. Box $i$ ($0 \le i \le n - 1$) has a capacity of $c\[i]$ candies.

Aunty Khong spends $q$ days preparing the boxes. On day $j$ ($0 \le j \le q - 1$), she performs an action specified by three integers $l\[j]$, $r\[j]$ and $v\[j]$ where $0 \le l\[j] \le r\[j] \le n - 1$ and $v\[j] \ne 0$. For each box $k$ satisfying $l\[j] \le k \le r\[j]$:

• If $v\[j] > 0$, Aunty Khong adds candies to box $k$, one by one, until she has added exactly $v\[j]$ candies or the box becomes full. In other words, if the box had $p$ candies before the action, it will have $\min{(c\[k], p + v\[j])}$ candies after the action.
• If $v\[j] < 0$, Aunty Khong removes candies from box $k$, one by one, until she has removed exactly $-v\[j]$ candies or the box becomes empty. In other words, if the box had $p$ candies before the action, it will have $\max{(0, p + v\[j])}$ candies after the action.

Your task is to determine the number of candies in each box after the $q$ days.

• $1 \le n \le 200\\,000$
• $1 \le q \le 200\\,000$
• $1 \le c\[i] \le 10^9$ (for all $0 \le i \le n - 1$)
• $0 \le l\[j] \le r\[j] \le n - 1$ (for all $0 \le j \le q - 1$)
• $-10^9 \le v\[j] \le 10^9$, $v\[j] \ne 0$ (for all $0 \le j \le q - 1$)