#include <cstdio>
#include<algorithm>
#define sp 1000010
using namespace std;

int a[sp];
int b[sp];
int c[sp];

int sol[sp];
int lp[sp];

int n;

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])
        swap(a[1],b[1]);
    for(int i=2;i<n;i++)
    {
        a[i]=((long long)a[i-1]*i)%n;
        b[i]=((long long)b[i-1]*i)%n;
        c[i]=((long long)c[i-1]*i)%n;

        if(a[i]>b[i])
            swap(a[i],b[i]);
    }

    for(int i=n-1;i>=1;i--)
    {
        for(int j=a[i];j<=b[i];)
            if(!sol[j])
            {
                sol[j]=c[i];
                lp[j]=b[i]+1;
                j++;
            }
            else
            {
                j=lp[j];
            }
    }
    for(int i=1;i<n;i++)
        printf("%d\n",sol[i]);
    return 0;
}