#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f;
const double  pi = acos(-1.0);
const ll N = 1e3 + 10;
int mat[N][N];
ll ans[N][N];
struct node
{
    int root;
    ll add;
} line[N], cal[N];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n, m, q;
        scanf("%d%d%d", &n, &m, &q);
        for(int i = 0; i<n; i++)
            line[i].root = i, line[i].add = 0LL;
        for(int j = 0; j<m; j++)
            cal[j].root = j, cal[j].add =0LL;
        for(int i = 0; i<n; i++)
            for(int j = 0; j<m; j++)
                scanf("%d", &mat[i][j]);
        int x, y, a;
        while(q--)
        {
            scanf("%d%d%d", &a, &x, &y);
            --x;
            if(a == 1)
            {
                --y;
                swap(line[x], line[y]);
            }
            if(a == 2)
            {
                --y;
                swap(cal[x], cal[y]);
            }
            if(a == 3)
            {
                //--y;
                line[x].add+=y;
            }
            if(a == 4)
            {
                cal[x].add+=y;
            }
        }
        for(int i = 0; i<n; i++)
            for(int j = 0; j<m; j++)
        {
            ans[i][j] = mat[line[i].root][cal[j].root] + line[i].add + cal[j].add;
        }
       /* for(int i = 0; i<n; i++)
            for(int j = 0; j<m; j++)
        {
            ans[i][j] += line[i].add + cal[j].add;
        }
     /*   for(int i = 0; i<n; i++)
            printf("%d ", line[i].root);
        printf("\n");
        for(int i = 0; i<m; i++)
            printf("%d ", cal[i].root);
        printf("\n");
        */
        for(int i = 0; i<n; i++)
        {
            for(int j = 0; j<m; j++)
            {
                if(j == 0)
                    printf("%I64d", ans[i][j]);
                else printf(" %I64d", ans[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}