#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return a > val ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
struct Node {
  int val;
  Node *l, *r, *u, *d;
  Node() : val(0), l(0), r(0), u(0), d(0) {}
};
const int maxn = 1000 + 10;
int n, m, q;
int a[maxn][maxn];
Node* node[maxn][maxn];
int ans[maxn][maxn];
void trace(Node* cur, int i, int j) {
  if (~ans[i][j]) return;
  ans[i][j] = cur->val;
  if (cur->l) trace(cur->l, i, j - 1);
  if (cur->r) trace(cur->r, i, j + 1);
  if (cur->u) trace(cur->u, i - 1, j);
  if (cur->d) trace(cur->d, i + 1, j);
}
Node* query(int u, int v) {
  Node* res = node[0][1];
  for (int i = 0; i < u; i++) res = res->d;
  for (int i = 1; i < v; i++) res = res->r;
  return res;
}
void solve() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++) {
      scanf("%d", &a[i][j]);
    }
  for (int i = (0); i < (n + 2); i++)
    for (int j = (0); j < (m + 2); j++) {
      node[i][j] = new Node();
      node[i][j]->val = a[i][j];
    }
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++) {
      node[i][j]->l = node[i][j - 1], node[i][j - 1]->r = node[i][j];
      node[i][j]->r = node[i][j + 1], node[i][j + 1]->l = node[i][j];
      node[i][j]->u = node[i - 1][j], node[i - 1][j]->d = node[i][j];
      node[i][j]->d = node[i + 1][j], node[i + 1][j]->u = node[i][j];
    }
  while (q--) {
    int a, b, c, d, h, w;
    scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &h, &w);
    vector<pair<Node*, Node*> > vl, vr, vu, vd;
    Node *x = query(a, b), *y = query(c, d);
    for (int i = (0); i < (h); i++) {
      vr.push_back(make_pair(x->l, y->l));
      vl.push_back(make_pair(x, y));
      x = x->d, y = y->d;
    }
    x = query(a, b + w - 1), y = query(c, d + w - 1);
    for (int i = (0); i < (h); i++) {
      vl.push_back(make_pair(x->r, y->r));
      vr.push_back(make_pair(x, y));
      x = x->d, y = y->d;
    }
    x = query(a, b), y = query(c, d);
    for (int i = (0); i < (w); i++) {
      vd.push_back(make_pair(x->u, y->u));
      vu.push_back(make_pair(x, y));
      x = x->r, y = y->r;
    }
    x = query(a + h - 1, b), y = query(c + h - 1, d);
    for (int i = (0); i < (w); i++) {
      vu.push_back(make_pair(x->d, y->d));
      vd.push_back(make_pair(x, y));
      x = x->r, y = y->r;
    }
    for (int i = (0); i < (int((vl).size())); i++)
      swap(vl[i].first->l, vl[i].second->l);
    for (int i = (0); i < (int((vr).size())); i++)
      swap(vr[i].first->r, vr[i].second->r);
    for (int i = (0); i < (int((vu).size())); i++)
      swap(vu[i].first->u, vu[i].second->u);
    for (int i = (0); i < (int((vd).size())); i++)
      swap(vd[i].first->d, vd[i].second->d);
  }
  memset(ans, -1, sizeof(ans));
  trace(node[0][1], 0, 1);
  for (int i = (1); i < (n + 1); i++)
    for (int j = (1); j < (m + 1); j++)
      printf("%d%c", ans[i][j], " \n"[j == m]);
}
int main() {
  solve();
  return 0;
}
