#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
struct node {
  int x, y, val;
} a[N * N];
int n, m, k;
int calc(int x, int y) { return x * (m + 1) + y; }
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) scanf("%d", &a[calc(i, j)].val);
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= m; j++) {
      a[calc(i, j)].x = calc(i, j + 1);
      a[calc(i, j)].y = calc(i + 1, j);
    }
  while (k--) {
    int X1, Y1, X2, Y2, h, w, s1 = 0, s2 = 0;
    scanf("%d%d%d%d%d%d", &X1, &Y1, &X2, &Y2, &h, &w);
    for (int i = 1; i < X1; i++) s1 = a[s1].y;
    for (int i = 1; i < Y1; i++) s1 = a[s1].x;
    for (int i = 1; i < X2; i++) s2 = a[s2].y;
    for (int i = 1; i < Y2; i++) s2 = a[s2].x;
    int p1 = s1, p2 = s2;
    for (int i = 1; i <= w; i++) {
      p1 = a[p1].x, p2 = a[p2].x;
      swap(a[p1].y, a[p2].y);
    }
    for (int i = 1; i <= h; i++) {
      p1 = a[p1].y, p2 = a[p2].y;
      swap(a[p1].x, a[p2].x);
    }
    p1 = s1, p2 = s2;
    for (int i = 1; i <= h; i++) {
      p1 = a[p1].y, p2 = a[p2].y;
      swap(a[p1].x, a[p2].x);
    }
    for (int i = 1; i <= w; i++) {
      p1 = a[p1].x, p2 = a[p2].x;
      swap(a[p1].y, a[p2].y);
    }
  }
  int t = 0;
  for (int i = 1; i <= n; i++) {
    t = a[t].y;
    int p = t;
    for (int j = 1; j <= m; j++) {
      p = a[p].x;
      printf("%d ", a[p].val);
    }
    puts("");
  }
  return 0;
}
