#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
int Map[1010][1010];
int hx[1010],hy[1010],h[1010],l[1010];
int main()
{
    int T;
    scanf("%d",&T);
    int n,m,q;
    while(T--)
    {
        memset(hx,0,sizeof(hx));
        memset(hy,0,sizeof(hy));
        scanf("%d %d %d",&n,&m,&q);
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                scanf("%d",&Map[i][j]);
            }
        }
        for(int i=1; i<=n; i++)
        {
            h[i] = i;
        }
        for(int i=1; i<=m; i++)
        {
            l[i] = i;
        }

        while(q--)
        {
            int d, x, y;
            scanf("%d %d %d",&d,&x,&y);
            if(d == 1)
            {
                swap(h[x],h[y]);
            }
            else if(d == 2)
            {
                swap(l[x],l[y]);
            }
            else if(d == 3)
            {
                hx[h[x]]+=y;
            }
            else
            {
                hy[l[x]]+=y;
            }
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                printf(j==m?"%d\n":"%d ",Map[h[i]][l[j]] + hx[h[i]] + hy[l[j]]);
            }
        }
    }
    return 0;
}