#include <cstdio>
using namespace std;
const int nmax=1000000;
int A[nmax+5],B[nmax+5],C[nmax+5],sol[nmax+5],oc[nmax+5];
int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    int n,i,j,k,ns,nd;
    scanf("%d%d%d%d",&n,&A[1],&B[1],&C[1]);
    oc[1]=1;
    for(i=2;i<=n-1;++i)
    {
        A[i]=((long long int)(A[i-1]*i))%n;
        B[i]=((long long int)(B[i-1]*i))%n;
        C[i]=((long long int)(C[i-1]*i))%n;
        oc[i]=i;
    }
    for(i=n-1;i>=1;--i)
    {
        if(A[i]<B[i])
            ns=A[i];
        else
            ns=B[i];
        if(A[i]<B[i])
            nd=B[i];
        else
            nd=A[i];
        while(ns<=nd)
        {
            if(oc[ns]==ns)
            {
            sol[ns]=C[i];
            oc[ns]=nd;
            ns++;
            }
            else
            {
                int aux=oc[ns];
                oc[ns]=nd;
                ns=aux;
            }
        }
    }
    for(i=1;i<=n-1;++i)
        printf("%d\n",sol[i]);
    return 0;
}