#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          1000005
#define   maxnode       10
#define   sigma_size    2
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
const double inf   = 1e18;
const double eps   = 1e-9;
//const LL     mod   = 1e9+7;
const ull    mxx   = 1333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/

int a[1005][1005];
struct OP{
    int o,x,y;
}op[100005];
int row[1005];
int col[1005];
int addr[1005];
int addc[1005];
int main(){
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    cin>>t;
    while(t--){
        int n,m,q;
        cin>>n>>m>>q;
        mem(addr,0);
        mem(addc,0);
        for(int i=1;i<=1000;i++){
            row[i]=i;
            col[i]=i;
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++) scanf("%d",&a[i][j]);
        }
        for(int i=0;i<q;i++){
            int op,x,y;
            scanf("%d%d%d",&op,&x,&y);
            if(op==1){
                swap(row[x],row[y]);
            }
            else if(op==2) swap(col[x],col[y]);
            else if(op==3){
                addr[row[x]]+=y;
            }
            else if(op==4){
                addc[col[x]]+=y;
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                a[row[i]][col[j]]+=(addr[row[i]]+addc[col[j]]);
                printf("%d",a[row[i]][col[j]]);
                if(j==m) printf("\n");
                else printf(" ");
            }
            //printf("\n");
        }
    }
    return 0;
}