/**


*/

#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 17;
const ll Mod = 1e9+7;
const ll inf = 0x3f3f3f3f;
ll add[1005][2];
ll a[1005][1005];
int row[1005], col[1005];
int main()
{
    int T, n, m, q, x, y, z;
    cin>>T;
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&q);
        for(int i = 0; i<n; i++) row[i] = i;
        for(int i = 0; i<m; i++) col[i] = i;
        for(int i = 0; i < n; i++){
            for(int j = 0; j<m; j++){
                scanf("%I64d",&a[i][j]);
            }
        }
        memset(add,0,sizeof add);
        while(q--){
            scanf("%d%d%d",&x,&y,&z);

            switch(x)
            {
                case 1:y--, z--;swap(row[z],row[y]);
                    break;
                case 2:y--,z--;swap(col[y],col[z]);
                    break;
                case 3:y--;add[row[y]][0]+=z;
                    break;
                case 4:y--;add[col[y]][1]+=z;
                    break;
            }
        }

        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                printf("%I64d%s",a[row[i]][col[j]]+add[row[i]][0]+add[col[j]][1],j==m-1?"\n":" ");
            }
        }


    }
    return 0;
}