#include <stdio.h>
#define maxn 1000010

long n, i, p, k, a[maxn][4], u[maxn], v[maxn];

int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    scanf("%d %d %d %d\n", &n, &a[1][0], &a[1][1], &a[1][2]);
    for(i=2; i<n; i++)
    {
        a[i][0]=(1LL*a[i-1][0]*i)%n;
        a[i][1]=(1LL*a[i-1][1]*i)%n;
        a[i][2]=(1LL*a[i-1][2]*i)%n;
    }
    for(i=1; i<=n; i++)
    {
        u[i]=i+1;
    }
    for(i=n-1; i>0; i--)
    {
        if(a[i][0]>a[i][1])
        {
            k=a[i][0];
            a[i][0]=a[i][1];
            a[i][1]=k;
        }
        p=a[i][0];
        while(p<=a[i][1])
        {
            if(v[p]==0) v[p]=a[i][2];
            k=p;
            p=u[p];
            u[k]=a[i][1]+1;
        }
    }
    for(i=1; i<n; i++)
    {
        printf("%d\n", v[i]);
    }
    return 0;
}