#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
struct dl {
  int v;
  dl *d, *r;
} e[N][N];
int main() {
  int n, m, q, i, j, a, b, c, d, s, t;
  dl *x, *y, *u, *v;
  cin >> n >> m >> q;
  for (i = 1; i <= n; ++i)
    for (j = 1; j <= m; ++j) scanf("%d", &e[i][j].v);
  for (i = 0; i <= n; ++i)
    for (j = 0; j <= m; ++j) e[i][j].d = &e[i + 1][j], e[i][j].r = &e[i][j + 1];
  while (q--) {
    x = y = &e[0][0];
    scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &s, &t);
    while (--a) x = x->d;
    while (--b) x = x->r;
    while (--c) y = y->d;
    while (--d) y = y->r;
    u = x, v = y;
    for (i = 0; i < s; ++i) u = u->d, v = v->d, swap(u->r, v->r);
    for (i = 0; i < t; ++i) x = x->r, y = y->r, swap(x->d, y->d);
    for (i = 0; i < t; ++i) u = u->r, v = v->r, swap(v->d, u->d);
    for (i = 0; i < s; ++i) x = x->d, y = y->d, swap(x->r, y->r);
  }
  x = &e[0][0];
  x = x->d;
  for (i = 0; i < n; ++i) {
    y = x;
    for (j = 0; j < m; ++j) y = y->r, printf("%d ", y->v);
    putchar('\n');
    x = x->d;
  }
}
