/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<set>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-10
#define ll long long
using namespace std;
const int N = 1005;
const int M = 10000 + 10;
const int inf = 100000000;
const int mod = 2009;
__int64 s[N][N],s2[N][N];
struct node
{
    __int64 sum;
}r[N],c[N];
int pr[N],pc[N];
int main()
{
    int t,n,m,q,a,x,y,i,j;
    scanf("%d",&t);
    while(t--)
    {
        memset(r,0,sizeof(r));
        memset(c,0,sizeof(c));
        scanf("%d%d%d",&n,&m,&q);
        for(i=1;i<=n;i++)
        {
            pr[i]=i;
            for(j=1;j<=m;j++)
            {
                pc[j]=j;
                s2[i][j]=0;
                scanf("%I64d",&s[i][j]);
            }
        }
        for(i=0;i<q;i++)
        {
            scanf("%d%d%d",&a,&x,&y);
            if(a==1)
                swap(pr[x],pr[y]);
            else if(a==2)
                swap(pc[x],pc[y]);
            else if(a==3)
                r[pr[x]].sum += y;
            else
                c[pc[x]].sum += y;
        }
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
                s2[i][j] = s[pr[i]][pc[j]] + r[pr[i]].sum + c[pc[j]].sum;
        }
        for(i=1;i<=n;++i)
        {
            for(j=1;j<m;++j)
                printf("%I64d ",s2[i][j]);
                printf("%I64d\n",s2[i][j]);
        }

    }
    return 0;
}