#include <cstdio>
#include <algorithm>
using namespace std;
int ma[1002][1002];
int main() {
    int tt;
    scanf("%d", &tt);
    while (tt--) {
        int n, m, q, adx[1002], ady[1002], bx[1002], by[1002], o, x, y;
        for (int i = 0; i < 1002; i++) {
            bx[i] = i;
            by[i] = i;
            adx[i] = ady[i] = 0;
        }
        scanf("%d%d%d", &n, &m, &q);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                scanf("%d", &ma[i][j]);
            }
        }
        for (int i = 0; i < q; i++) {
            scanf("%d%d%d", &o, &x, &y);
            switch (o) {
            case 1:
                swap(bx[x], bx[y]);
                break;
            case 2:
                swap(by[x], by[y]);
                break;
            case 3:
                adx[bx[x]] += y;
                break;
            case 4:
                ady[by[x]] += y;
                break;
            }
        }
        //printf("adx%d\n",adx[1]);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                printf("%d%s",ma[bx[i]][by[j]]+adx[bx[i]]+ady[by[j]],j==m?"":" ");
            }
            printf("\n");
        }

    }
    return 0;
}