func_code_string: #include <bits/stdc++.h>   using namespace std;   const double PI = acos(-1);   const long long MOD = 998244353;   struct node {     int v;     node *d, *r;   };   node a[1050][1050];   long long n, m, q;   void solve() {     cin >> n >> m >> q;     for (int i = (int)(1); i <= (int)(n); i += 1) {       for (int j = (int)(1); j <= (int)(m); j += 1) {         cin >> a[i][j].v;       }     }     for (int i = (int)(0); i <= (int)(n); i += 1) {       for (int j = (int)(0); j <= (int)(m); j += 1) {         a[i][j].r = &a[i][j + 1];         a[i][j].d = &a[i + 1][j];       }     }     while (q--) {       long long e, b, c, d, h, w;       cin >> e >> b >> c >> d >> h >> w;       node *x, *y, *j, *k;       x = y = &a[0][0];       for (int i = (int)(1); i <= (int)(e - 1); i += 1) x = x->d;       for (int i = (int)(1); i <= (int)(b - 1); i += 1) x = x->r;       for (int i = (int)(1); i <= (int)(c - 1); i += 1) y = y->d;       for (int i = (int)(1); i <= (int)(d - 1); i += 1) y = y->r;       j = x, k = y;       for (int i = (int)(1); i <= (int)(h); i += 1) {         x = x->d, y = y->d;         swap(x->r, y->r);       }       for (int i = (int)(1); i <= (int)(w); i += 1) {         x = x->r, y = y->r;         swap(x->d, y->d);       }       for (int i = (int)(1); i <= (int)(w); i += 1) {         j = j->r, k = k->r;         swap(j->d, k->d);       }       for (int i = (int)(1); i <= (int)(h); i += 1) {         j = j->d, k = k->d;         swap(j->r, k->r);       }     }     node *x = &a[0][0];     for (int i = (int)(1); i <= (int)(n); i += 1) {       x = x->d;       node *y = x;       for (int j = (int)(1); j <= (int)(m); j += 1) {         y = y->r;         cout << y->v <<    ;       }       cout << endl;     }   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     int t = 1;     while (t--) {       solve();     }   }   