#include <iostream>
#include<cstdio>
#define ll long long
using namespace std;
int n;
int v[1000001], dad[1000001], a[1000001], b[1000001], c[1000001];
int next(int x)
{
    if(dad[x]==0) return x;
    return dad[x]=next(dad[x]);}
int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out","w", stdout);
    long long i,j,aux;
    scanf("%d%d%d%d", &n, &a[1], &b[1], &c[1]);
    for(i=2;i<n;i++)
    {
        a[i]=((ll)a[i-1]*i)%n;
        b[i]=((ll)b[i-1]*i)%n;
        c[i]=((ll)c[i-1]*i)%n;
    }
    for(i=n-1;i>=1;i--)
    {
        if(a[i]>b[i])
        {
            aux=a[i];
            a[i]=b[i];
            b[i]=aux;
        }
        j=next(a[i]);
        while(j<=b[i])
        {
            v[j]=c[i];
            dad[j]=b[i]+1;
            j=next(j+1);
        }
    }
    for(i=1;i<n;i++)
        printf("%d\n", v[i]);
    return 0;
}