#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;
int m[1505][1505],n,aux[1505];
int main()
{
    freopen("patrat.in","r",stdin);
    freopen("patrat.out","w",stdout);
    int a,b,c,d,i,j;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            m[i][j]=j;
    while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
    {
        d%=n;
        for(i=1;i<=n;++i)
        {
            int val=i-d;
            if(val<1)val+=n;
            if(val>n)val-=n;
            if(b==1)aux[i]=m[c][val];
            else aux[i]=m[val][c];
        }
        for(i=1;i<=n;++i)
            if(b==1)m[c][i]=aux[i];
            else m[i][c]=aux[i];
    }
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=n;++j)
            printf("%d ",m[i][j]);
        printf("\n");
    }
    return 0;
}