#include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<cmath>
#include<vector>
#include<string>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;

const LL maxn = 1100;

LL a[maxn][maxn],s[maxn][maxn];
LL x[maxn],y[maxn];
LL sx[maxn],sy[maxn];

int main()
{
    LL t,n,m,q,l,i,j;
    
    scanf("%I64d",&t);
    while( t-- )
    {
        memset( sx,0,sizeof sx );
        memset( sy,0,sizeof sy );
        
        scanf("%I64d%I64d%I64d",&n,&m,&q);
        for( i=1;i<=n;i++ )
        {
            x[i] = i;
            for( j=1;j<=m;j++ )
            {
                y[j] = j;
                scanf("%I64d",&a[i][j]);
            }
        }
        while( q-- )
        {
            scanf("%I64d%I64d%I64d",&l,&i,&j);
            if( l == 1 )
            {
                LL tmp;
                tmp = x[i], x[i] = x[j], x[j] = tmp;
            }
            else if( l == 2 )
            {
                LL tmp;
                tmp = y[i]; y[i] = y[j]; y[j] = tmp;
            }
            else if( l == 3 ) sx[x[i]] += j;
            else sy[y[i]] += j;
        }
        
        for( i=1;i<=n;i++ )
            for( j=1;j<=m;j++ )
                s[i][j] = a[x[i]][y[j]]+sx[x[i]]+sy[y[j]];
                
        for( i=1;i<=n;i++ )
        {
            for( j=1;j<m;j++ )
                printf("%I64d ",s[i][j]);
            printf("%I64d\n",s[i][j]);
        }
    }
    
    return 0;
}