#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>

using namespace std;

typedef long long LL;

int T,n,m,q,ma[1005][1005];
int z,x,y,dq;
int f[1005],g[1005],a1[1005],a2[1005];
int main()
{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d%d%d",&n,&m,&q);
        for (int i=1;i<=n;++i)
            for (int j=1;j<=m;++j) scanf("%d",&ma[i][j]);
        for (int i=1;i<=n;++i) f[i]=i;
        for (int i=1;i<=m;++i) g[i]=i;
        for (int i=1;i<=n;++i) a1[i]=0;
        for (int i=1;i<=m;++i) a2[i]=0;
        while (q--)
        {
            scanf("%d",&z);
            scanf("%d%d",&x,&y);
            if (z==1)
            {
                swap(f[x],f[y]);
            }
            if (z==2)
            {
                swap(g[x],g[y]);
            }
            if (z==3)
            {
                a1[f[x]]+=y;
            }
            if (z==4)
            {
                a2[g[x]]+=y;
            }
        }
        for (int i=1;i<=n;++i)
        {
            for (int j=1;j<=m;++j)
            {
                dq=ma[f[i]][g[j]];
                dq+=a1[f[i]];
                dq+=a2[g[j]];
                printf("%d",dq);
                if (j==m) printf("\n");else printf(" ");
            }
        }
    }    
    return 0;
}