A terrace is modelled as an array of L cells indexed 0 through L-1, each starting at height 0. You are given q operations. Each operation l r v raises every cell with index in the inclusive range [l, r] by v (which may be negative, lowering the cells). Apply all operations in the given order and print the final height of every cell.
Input format
Line 1: two integers L and q.
Next q lines: three integers l, r, v (0 ≤ l ≤ r ≤ L-1).
Output format
One line with L integers separated by single spaces: the final heights of cells 0 through L-1.
Constraints
- 1 ≤ L ≤ 100000
- 1 ≤ q ≤ 100000
- -1000000 ≤ v ≤ 1000000