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 mcolumns and q tasks. Each task is to swap two submatrices of the given matrix.

For each task Vasiliy knows six integers ai, bi, ci, di, hi, wi, where ai is the index of the row where the top-left corner of the first rectangle is located, bi is the index of its column, ci is the index of the row of the top-left corner of the second rectangle, di is the index of its column, hi is the height of the rectangle and wi 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.

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 vi,?j (1?≤?vi,?j?≤?109) each — initial values of the cells of the matrix.

Each of the following q lines contains six integers ai, bi, ci, di, hi, wi (1?≤?ai,?ci,?hi?≤?n, 1?≤?bi,?di,?wi?≤?m).

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

4 4 21 1 2 21 1 2 23 3 4 43 3 4 41 1 3 3 2 23 1 1 3 2 2output
4 4 3 34 4 3 32 2 1 12 2 1 1input
4 2 11 11 12 22 21 1 4 1 1 2output
2 21 12 21 1
參考博客
題意：給定一個n*m的矩陣，給定q次剪切交換，每次給出a,b,c,d,h,w表示將左上角為(a,b)和左上角為(c,d)的高h寬w的矩陣交換，保證兩個矩形不重疊沒有公共邊。
分析：對每個格子建一個十字鏈表，每次剪切的時候我們只需要將周圍的那些鏈表交換即可。O(q*(n+m))
代碼見參考博客的代碼，比較清晰