#include<cstdio>
#include<fstream>
#include<algorithm>
#define nmax 1000001
#define ll long long
using namespace std;
int n,i,j;
ll a[nmax],b[nmax],c[nmax],aux;
int k[nmax],jump[nmax];
int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d ", &n, &a[1], &b[1], &c[1]);
    if(a[1]>b[1]){aux=a[1];a[1]=b[1];b[1]=aux;}
    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;
        if(a[i]>b[i]){aux=a[i];a[i]=b[i];b[i]=aux;}
    }
    for(i=n-1;i>=1;--i)
        for(j=a[i];j<=b[i];)
            if(!k[j])
            {
                k[j]=c[i];
                jump[j]=b[i]+1;
                ++j;
            }
            else
                j=jump[j];
    for(i=1;i<n;++i)
        printf("%d\n", k[i]);
    return 0;
}