#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll N = 1001;
ll n,m,q,a[N][N],b[N][N],t1[N],t2[N],t3[N],t4[N],i,j,T,op,x,y;
int main() {
    scanf("%I64d",&T);
    while (T--)
    {
        scanf("%I64d%I64d%I64d",&n,&m,&q);
        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++)
                scanf("%I64d",&a[i][j]);
        for (i=1;i<=n;i++)
            t1[i]=i;
        for (i=1;i<=m;i++)
            t2[i] = i;
        memset(t3, 0, sizeof t3);
        memset(t4, 0, sizeof t4);
        while (q--)
        {
            scanf("%I64d%I64d%I64d",&op,&x,&y);
            if (op == 1)
            {
                swap(t1[x], t1[y]);
            }
            if (op == 2)
            {
                swap(t2[x], t2[y]);
            }
            if (op == 3)
            {
                t3[t1[x]] += y;
            }
            if (op == 4)
            {
                t4[t2[x]] += y;
            }
        }
        for (i=1;i<=n;i++)
        {
            for (j=1;j<m;j++)
                printf("%I64d ",a[t1[i]][t2[j]]+t3[t1[i]]+t4[t2[j]]);
            j=m;
            printf("%I64d\n",a[t1[i]][t2[j]]+t3[t1[i]]+t4[t2[j]]);
        }
    }
}