#include <cstdio>
#include <fstream>
using namespace std;

int n,a,b,c,k,Min,Max,i;
int v[1000001];

int main()
{

    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a,&b,&c);

    k=1;
    while((a!=0||b!=0)&&(k<=n-1))
    {
        Min=min(a,b);
        Max=max(a,b);
        for(i=Min;i<=Max;++i) v[i]=c;
        ++k;
        a=(a*k)%n;
        b=(b*k)%n;
        c=(c*k)%n;
    }

    for(i=1;i<=n-1;++i) printf("%d\n",v[i]);

    return 0;
}