Wall

Gianina builds a wall of $n$ columns of equal bricks. Columns are numbered $0$ through $n-1$ from left to right. The height of a column is its brick count.

Initially every column has height 0. Over $k$ steps, each step gives an inclusive column range $[\text{left}, \text{right}]$ and a height $h$.

• Add (op=1): within the range, any column shorter than $h$ receives bricks until its height is exactly $h$. Columns already at least $h$ stay unchanged.
• Remove (op=2): within the range, any column taller than $h$ loses bricks until its height is exactly $h$. Columns already at most $h$ stay unchanged.

After all steps, output the final brick count in each column.

Line 1: $n$, $k$.

Next $k$ lines: op left right height

• op=1 add, op=2 remove
• left, right: inclusive range ($0 \le \text{left} \le \text{right} < n$)
• height: target height

Print the final brick count of each column, one per line from left to right.