#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000001], b[1000001], c[1000001], sol[1000001];
int main()
{
    int n, i, j, nr=0;
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d%d%d%d",&n,&a[1],&b[1],&c[1]);
    for (i=1; i<n; i++)
    {
        if (i!=1)
        {
            a[i]=(a[i-1]*i)%n;
            b[i]=(b[i-1]*i)%n;
            c[i]=(c[i-1]*i)%n;
        }
        //for (j=min(a[i],b[i]); j<=max(a[i],b[i]); j++) sol[j]=c[i];
    }
    for (i=n-1; i>=1; i--)
    {
        for (j=min(a[i],b[i]); j<=max(a[i],b[i]); j++)
            if (sol[j]==0) {sol[j]=c[i]; nr++;}
        if (nr>=n-1) break;
    }
    for (i=1; i<n; i++)
    {
        printf("%d\n",sol[i]);
    }
    return 0;
}