#include<cstdio>
#define m(a,b) (a)<(b)?(a):(b)
#define M(a,b) (a)>(b)?(a):(b)
const int max=1000000;
int n,a[max],b[max],c[max],left,i,j,k,p[max],fin[max],x,y;
int main()
{
	freopen("curcubeu.in","r",stdin);
	freopen("curcubeu.out","w",stdout);
	scanf("%d %d %d %d",&n,&x,&y,&c[1]);
	a[1]=m(x,y);
	b[1]=M(x,y);
	p[1]=1;
	for(i=2;i<n;++i)
	{
		x=((long long)a[i-1]*i)%n;
		y=((long long)b[i-1]*i)%n;
		a[i]=m(x,y);
		b[i]=M(x,y);
		c[i]=((long long)c[i-1]*i)%n;
		p[i]=i;
	}
	left=n-1;
	for(i=n-1;i>0 && left;--i)
	{
		k=0;
		for(j=1;j<=left;++j)
			if(p[j]<=a[i])
				fin[p[j]]=c[i];
			else
				p[++k]=p[j];
		left=k;
	}
	for(i=1;i<n;i++)
		printf("%d\n",fin[i]);
	fclose(stdout);
	return 0;
}