#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 10004;

int a[N][N], now[2][N], ori[2][N], sum[2][N];

void solve()
{
    int n, m, q;
    scanf("%d%d%d", &n, &m, &q);
    memset(sum, 0, sizeof(sum));
    for (int i=1; i<=n; ++i) {
        now[0][i] = ori[0][i] = i;
    }
    for (int j=1; j<=m; ++j) {
        now[1][j] = ori[1][j] = j;
    }
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j) {
            scanf("%d", &a[i][j]);
        }
    }
    for (int i=0; i<q; ++i) {
        int op, x, y;
        scanf("%d%d%d", &op, &x, &y);
        if (op < 3) {
            --op;
            swap(now[op][ori[op][x]], now[op][ori[op][y]]);
            swap(ori[op][x], ori[op][y]);
        } else {
            op -= 3;
            sum[op][ori[op][x]] += y;
        }
    }
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j) {
            int x=ori[0][i], y=ori[1][j];
            printf("%d%c", a[x][y]+sum[0][x]+sum[1][y], j==m?'\n':' ');
        }
    }
}

int main()
{

    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}