#include <cstdio>
#include <algorithm>
#define NMAX 1000009
using namespace std;
int a[NMAX],b[NMAX],c[NMAX],next[NMAX],rasp[NMAX];
int main()
{
    int n,i,j;
    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])
        swap(a[1],b[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;
        if(a[i]>b[i])
            swap(a[i],b[i]);
    }
    for(i=n-1;i>=1;i--)
    {
        for(j=a[i];j<=b[i];j++)
        {
            if(rasp[j]==0)
            {
                rasp[j]=c[i];
                next[j]=b[i]+1;
            }
            else
            {
                j=next[j]-1;
            }
        }
    }
    for(i=1;i<n;i++)
        printf("%d\n",rasp[i]);
    return 0;
}