#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1000005],b[1000005],c[1000005],d[1000005];
int p[1000005];
int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    int n,i,j;
    scanf("%d%d%d%d",&n,&a[1],&b[1],&c[1]);d[1]=1;
    if(a[1]>b[1]) swap(a[1],b[1]);
    for(i=2;i<n;i++)
    {
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        if(b[i]<a[i]) swap(a[i],b[i]);
        c[i]=(1LL*c[i-1]*i)%n;
        d[i]=i;
    }
    d[n]=n;
    for(i=n-1;i>=1;i--)
        for(j=a[i];j<=b[i];)
            if(!p[j])
            {
                p[j]=c[i];
                d[j]=b[i]+1;
                j++;
            }
            else
            {
                int jj=d[j];
                if(d[j]<b[i]+1) d[j]=b[i]+1;
                j=jj;
            }
    for(i=1;i<n;i++)
        printf("%d\n",p[i]);
    return 0;
}