#include <cstdio>
#include <algorithm>
#define nmax 1000100
using namespace std;
int n,a[nmax],b[nmax],c[nmax];
int t[nmax],v[nmax];

int main()
{
    int i,j,k,p;
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
    for (i=2;i<n;i++) {
        a[i]=(1LL*a[i-1]*i)%n;
        b[i]=(1LL*b[i-1]*i)%n;
        c[i]=(1LL*c[i-1]*i)%n;
    }
    for (i=n-1;i>=1;i--) {
        if (a[i]>b[i])
            swap(a[i],b[i]);
        for (k=b[i]+1;v[k]&k<n;k=t[k]);

        for (j=a[i];j<=b[i];)
            if (v[j]) {
                p=t[j];
                t[j]=k;
                j=p;
            }
            else {
                v[j]=c[i];
                t[j]=k;
                j++;
            }
    }
    for (i=1;i<n;i++)
        printf("%d\n",v[i]);
    return 0;
}