CF706E.Working routine

Vasiliy finally got to work, where there is a huge amount of tasks waiting for him. Vasiliy is given a matrix consisting of n rows and m columns and q tasks. Each task is to swap two submatrices of the given matrix.

For each task Vasiliy knows six integers a__i, b__i, c__i, d__i, h__i, w__i, where a__i is the index of the row where the top-left corner of the first rectangle is located, b__i is the index of its column, c__i is the index of the row of the top-left corner of the second rectangle, d__i is the index of its column, h__i is the height of the rectangle and w__i is its width.

It's guaranteed that two rectangles in one query do not overlap and do not touch, that is, no cell belongs to both rectangles, and no two cells belonging to different rectangles share a side. However, rectangles are allowed to share an angle.

Vasiliy wants to know how the matrix will look like after all tasks are performed.

瓦西里终于开始工作了，他面前有大量任务等待完成。瓦西里收到一个由 $n$ 行 $m$ 列构成的矩阵，以及 $q$ 个任务。每个任务要求交换该矩阵中的两个子矩阵。

对于每个任务，瓦西里会得到六个整数 $a_i$, $b_i$, $c_i$, $d_i$, $h_i$, $w_i$，其中 $a_i$ 是第一个矩形左上角所在行的索引，$b_i$ 是其所在列的索引，$c_i$ 是第二个矩形左上角所在行的索引，$d_i$ 是其所在列的索引，$h_i$ 是矩形的高度，$w_i$ 是其宽度。

保证在同一个查询中，两个矩形互不重叠且互不接触，即：没有单元格同时属于两个矩形，且分别属于两个不同矩形的任意两个单元格也不共享一条边。但允许两个矩形仅在顶点处相接（即共享一个角）。

瓦西里想知道，在执行完所有任务后，该矩阵最终的样子。

The first line of the input contains three integers n, m and q (2 ≤ n, m ≤ 1000, 1 ≤ q ≤ 10 000) — the number of rows and columns in matrix, and the number of tasks Vasiliy has to perform.

Then follow n lines containing m integers v__i, j (1 ≤ v__i, j ≤ 109) each — initial values of the cells of the matrix.

Each of the following q lines contains six integers a__i, b__i, c__i, d__i, h__i, w__i (1 ≤ a__i, c__i, h__i ≤ n, 1 ≤ b__i, d__i, w__i ≤ m).

输入的第一行包含三个整数 $n$、$m$ 和 $q$（$2 \le n, m \le 1000$，$1 \le q \le 10\,000$）—— 分别表示矩阵的行数、列数，以及瓦西里需要执行的任务数量。

接下来是 $n$ 行，每行包含 $m$ 个整数 $v_{i,j}$（$1 \le v_{i,j} \le 10^9$）—— 表示矩阵各单元格的初始值。

随后的 $q$ 行中，每行包含六个整数 $a_i$、$b_i$、$c_i$、$d_i$、$h_i$、$w_i$（$1 \le a_i, c_i, h_i \le n$，$1 \le b_i, d_i, w_i \le m$）。

Print n lines containing m integers each — the resulting matrix.

输出 n 行，每行包含 m 个整数——即所得矩阵。