#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
struct info {
  int value, right, down;
  info(int value = 0, int right = 0, int down = 0) {
    this->value = value;
    this->right = right;
    this->down = down;
  }
} a[N];
int ptr, n, m, q;
int get(int x, int y) { return x * (m + 1) + y + 1; }
inline vector<pair<int, int>> swap(int x0, int y0, int x1, int y1, int len,
                                   int flag) {
  int D0 = get(x0, 0), D1 = get(x1, 0);
  for (int i = 1; i <= y0; i++) D0 = a[D0].right;
  for (int i = 1; i <= y1; i++) D1 = a[D1].right;
  vector<pair<int, int>> v(len);
  for (int i = 1; i <= len; i++) {
    v[i - 1] = (make_pair(D0, D1));
    if (flag) {
      D0 = a[D0].right;
      D1 = a[D1].right;
    } else {
      D0 = a[D0].down;
      D1 = a[D1].down;
    }
  }
  return v;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> q;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      if (i && j) cin >> a[get(i, j)].value;
      if (i + 1 <= n) a[get(i, j)].down = get(i + 1, j);
      if (j + 1 <= m) a[get(i, j)].right = get(i, j + 1);
    }
  }
  for (int i = 1; i <= q; i++) {
    int x0, y0, x1, y1, h, w;
    cin >> x0 >> y0 >> x1 >> y1 >> h >> w;
    auto r0 = swap(x0, y0 - 1, x1, y1 - 1, h, 0);
    auto r1 = swap(x0, y0 + w - 1, x1, y1 + w - 1, h, 0);
    auto d0 = swap(x0 - 1, y0, x1 - 1, y1, w, 1);
    auto d1 = swap(x0 + h - 1, y0, x1 + h - 1, y1, w, 1);
    for (const auto &[p, q] : r0) swap(a[p].right, a[q].right);
    for (const auto &[p, q] : r1) swap(a[p].right, a[q].right);
    for (const auto &[p, q] : d0) swap(a[p].down, a[q].down);
    for (const auto &[p, q] : d1) swap(a[p].down, a[q].down);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = a[get(i, 0)].right, c = 1; c <= m; j = a[j].right, ++c) {
      cout << a[j].value << " \n"[c == m];
    }
  }
}
