#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int a[1024][1024];
int hang[1024],lie[1024],x[1024],y[1024];
int main()
{
    int t,n,m,q,u,v,w,i,j,sw;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            scanf("%d%d%d",&n,&m,&q);
            for(i=1;i<=n;++i)
                for(j=1;j<=m;++j)
            {
                scanf("%d",&a[i][j]);
            }
            for(i=1;i<=n;++i){hang[i]=i;x[i]=0;}
            for(j=1;j<=m;++j){lie[j]=j;y[j]=0;}
            while(q--)
            {
                scanf("%d%d%d",&u,&v,&w);
                if(u==1)
                {
                     sw=hang[v];
                     hang[v]=hang[w];
                     hang[w]=sw;
                }
                if(u==2)
                {
                     sw=lie[v];
                     lie[v]=lie[w];
                     lie[w]=sw;
                }
                if(u==3)
                {
                     x[hang[v]]+=w;
                }
                if(u==4)
                {
                     y[lie[v]]+=w;
                }
            }
            for(i=1;i<=n;++i)
                for(j=1;j<=m;++j)
            {
                if(j!=m)printf("%d ",a[hang[i]][lie[j]]+x[hang[i]]+y[lie[j]]);
                else printf("%d\n",a[hang[i]][lie[j]]+x[hang[i]]+y[lie[j]]);
            }

        }
    }
    return 0;
}