#include <cstdio>
#include <algorithm>
#define Nmax 1000005

using namespace std;

int N,a[Nmax],b[Nmax],c[Nmax],nxt[Nmax],cul[Nmax];

int main()
{
    int i,j,st,dr;
    freopen ("curcubeu.in","r",stdin);
    freopen ("curcubeu.out","w",stdout);
    scanf("%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;--i)
    {
        st=min(a[i],b[i]);
        dr=max(a[i],b[i]);
        for(j=st;j<=dr;)
            if(!cul[j])
            {
                cul[j]=c[i];
                nxt[j]=dr+1;
                ++j;
            }
            else
                j=nxt[j];
    }
    for(i=1;i<N;++i)
        printf("%d\n", cul[i]);
    return 0;
}