Bae Chanwoo likes arrays

Chanwoo learned about two-dimensional arrays in an introductory programming class today. He found it so interesting that he decided to apply operations to the two-dimensional array.

Two kinds of operations are given as queries.

• 0 i j k: Change the value in column $j$ of row $i$ to $k$.
• 1 i j: Swap row $i$ and row $j$.

A swap exchanges every element of row $i$ with the corresponding element of row $j$.

After performing all $q$ queries, print the final array.

The first line contains the number of rows $N$, the number of columns $M$, and the number of queries $q$. $(1 \le N, M \le 3000, 1 \le q \le 10^6)$

From the second line onward, $N$ lines give the two-dimensional array with $N$ rows and $M$ columns. Each element of the array is an integer from 1 to $10\,000$.

The next $q$ lines contain the queries. A query has the form 0 i j k or 1 i j. If the first value is 0, perform the first operation. If it is 1, perform the second operation.

For the first operation, $i$, $j$, and $k$ satisfy $0 \le i \le N-1$, $0 \le j \le M-1$, and $1 \le k \le 10\,000$, where $k$ is an integer.

For the second operation, $i$ and $j$ satisfy $0 \le i, j \le N-1$.

Print the two-dimensional array after performing all $q$ queries.