#include<cstdio>
#include<queue>

using namespace std;
FILE *fin=fopen("curcubeu.in","r");
FILE *fout=fopen("curcubeu.out","w");
int v[1000002],urm[1000002],a[1000002],b[1000002],c[1000002];
int n,m,i,st,dr,last,poz;

int main()
{
    fscanf (fin,"%d%d%d%d",&n,&a[1],&b[1],&c[1]);
    for(i=2;i<n;i++)
    {
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        c[i]=(1LL*c[i-1]*i)%n;
    }
    for(i=n-1;i>=1;i--)
    {
        st=min(a[i], b[i]);
        dr=max(a[i], b[i]);
        poz=st;
        while(poz<=dr)
        {
            if(v[poz]!=0)
                poz=urm[poz];
            else
            {
                v[poz]=c[i];
                urm[poz]=dr+1;
                poz++;
            }
        }
    }
    for(i=1;i<n;i++)
        fprintf(fout,"%d\n",v[i]);
    return 0;
}