#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c=getchar(); x=;

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) {x=x*+c-''; c=getchar();}

}

const int maxn=;

int n,m,q;

int ans[maxn][maxn];

int op[],r[],c[],v[];

int main()

{

    scanf("%d%d%d",&n,&m,&q);

    for(int i=;i<=q;i++)

    {

        scanf("%d",&op[i]);

        if(op[i]==) scanf("%d",&r[i]);

        else if(op[i]==) scanf("%d",&c[i]);

        else scanf("%d%d%d",&r[i],&c[i],&v[i]);

    }

    for(int i=q;i>=;i--)

    {

        if(op[i]==) ans[r[i]][c[i]]=v[i];

        else if(op[i]==)

        {

            for(int j=m;j>;j--)

                swap(ans[r[i]][j],ans[r[i]][j-]);

        }

        else

        {

            for(int j=n;j>;j--)

                swap(ans[j][c[i]],ans[j-][c[i]]);

        }

    }

    for(int i=;i<=n;i++){

        for(int j=;j<=m;j++)

            printf("%d ",ans[i][j]);

        printf("\n");

    }

    return ;

}