Masking Tape

JOI is playing with paper and masking tape, coloring the paper.

The paper is a rectangle with a grid of $H$ rows and $W$ columns. The cell in row $i$ (counting from the top) and column $j$ (counting from the left) is called cell $(i, j)$.

Each cell has one color. Colors are integers. At the start, every cell has color $0$.

JOI performs $Q$ operations with this paper and masking tape. The $k$-th operation ($1 \le k \le Q$) depends on the integer $q_k$ as follows.

• If $q_k = 1$, the operation is given by integers $x_k, y_k, c_k$. For each of the cells $(x_k, y_k)$, $(x_k + 1, y_k)$, $(x_k, y_k + 1)$, and $(x_k + 1, y_k + 1)$, if the cell is not covered by masking tape, change its color to $c_k$. If the cell is covered by masking tape, do nothing to it.
• If $q_k = 2$, the operation is given by integers $x_k, y_k$. Cover the cells $(x_k, y_k)$, $(x_k + 1, y_k)$, $(x_k, y_k + 1)$, and $(x_k + 1, y_k + 1)$ with masking tape.

After all $Q$ operations, remove all the masking tape. When the tape is removed from a cell, the cell's color becomes the color it had just before it was covered.

Find the final color of every cell on the paper.

The input is given in the following format.

H W Q
(Query 1)
(Query 2)
:
(Query Q)

Each $(\text{Query } k)$ ($1 \le k \le Q$) is a line of space-separated integers. The first integer is $q_k$.

• If $q_k = 1$, the line contains three more integers $x_k, y_k, c_k$.
• If $q_k = 2$, the line contains two more integers $x_k, y_k$.

Print the final color of every cell in $H$ lines. The $i$-th line contains $W$ space-separated integers, where the $j$-th integer is the color of cell $(i, j)$.

• $2 \le H \le 500$.
• $2 \le W \le 500$.
• $1 \le Q \le 200\,000$.
• $q_k$ is either $1$ or $2$ ($1 \le k \le Q$).
• If $q_k = 1$, then $1 \le x_k \le H - 1$, $1 \le y_k \le W - 1$, and $1 \le c_k \le 10^9$ ($1 \le k \le Q$).
• If $q_k = 2$, then $1 \le x_k \le H - 1$ and $1 \le y_k \le W - 1$ ($1 \le k \le Q$).
• All input values are integers.