#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
    int T;
    scanf("%d", &T);
    for(int ii = 0; ii < T; ++ ii) {
        int n; int m; int q;
        scanf("%d%d%d", &n, &m, &q);
        vector<vector<int> > a(n, vector<int>(m));
        for(int i = 0; i < n; ++ i) for(int j = 0; j < m; ++ j)
            scanf("%d", &a[i][j]);
        vector<int> rows(n), cols(m);
        rep(i, n) rows[i] = i;
        rep(j, m) cols[j] = j;
        vector<int> addRow(n), addCol(m);
        for(int ii = 0; ii < q; ++ ii) {
            int ty;
            scanf("%d", &ty);
            if(ty == 1 || ty == 2) {
                int x; int y;
                scanf("%d%d", &x, &y), -- x, -- y;
                if(ty == 1)
                    swap(rows[x], rows[y]);
                else
                    swap(cols[x], cols[y]);
            } else if(ty == 3 || ty == 4) {
                int x; int y;
                scanf("%d%d", &x, &y), -- x;
                if(ty == 3)
                    addRow[rows[x]] += y;
                else
                    addCol[cols[x]] += y;
            } else abort();
        }
        rep(i, n) {
            rep(j, m) {
                if(j != 0) putchar(' ');
                int x = a[rows[i]][cols[j]];
                x += addRow[rows[i]];
                x += addCol[cols[j]];
                printf("%d", x);
            }
            puts("");
        }
    }
    return 0;
}