#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define M 1009
typedef long long ll;
int mp[M][M];
int h[M],l[M],addh[M],addl[M];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m,q;
        scanf("%d %d %d",&n,&m,&q);
        for(int i = 1;i <= n;i++)
        {
            h[i] = i;
            addh[i] = 0;
            for(int j = 1;j <= m;j++)
            {
                l[j] = j;
                addl[j] = 0;
                scanf("%d",&mp[i][j]);
            }
        }
        for(int i = 0;i < q;i++)
        {
            int a,b,c;
            scanf("%d %d %d",&a,&b,&c);
            if(a == 1)
            {
                swap(h[b],h[c]);
                swap(addh[b],addh[c]);
            }
            else if(a == 2)
            {
                swap(l[b],l[c]);
                swap(addl[b],addl[c]);
            }
            else if(a == 3) addh[b] += c;
            else if(a == 4) addl[b] += c;
        }
        for(int i = 1;i <= n;i++)
        {
            for(int j = 1;j <= m;j++)
            {
                printf("%d%c",mp[h[i]][l[j]]+addh[i]+addl[j],j == m ? '\n':' ');
            }
        }
    }
    return 0;
}