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