#include <stdio.h>
#define maxn 1000010

long n, i, p, k, a[maxn], b[maxn], c[maxn], 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], &b[1], &c[1]);
    for(i=2; i<n; i++)
    {
        a[i]=((long long)a[i-1]*i)%n;
        b[i]=((long long)b[i-1]*i)%n;
        c[i]=((long long)c[i-1]*i)%n;
        u[i-1]=i;
    }
    for(i=n-1; i>0; i--)
    {
        if(a[i]>b[i])
        {
            k=a[i];
            a[i]=b[i];
            b[i]=k;
        }
        p=a[i];
        while(p<=b[i])
        {
            if(v[p]==0) v[p]=c[i];
            k=p;
            p=u[p];
            u[k]=b[i]+1;
        }
    }
    for(i=1; i<n; i++)
    {
        printf("%d\n", v[i]);
    }
    return 0;
}