#include<cstdio>
#define m(a,b) (a)<(b)?(a):(b)
#define M(a,b) (a)>(b)?(a):(b)
const int max=1000100;
int n,a[max],b[max],c[max],left,i,j,k,next[max],fin[max],x,y;
int getnext(int x)
{
	if(!fin[next[x]]) return next[x];
	next[x]=getnext(next[x]);
	return next[x];
}
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);
	next[0]=1;
	next[1]=2;
	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;
		next[i]=i+1;
	}
	for(i=n-1;i>0;--i)
		for(j=getnext(a[i]-1);j<=b[i];j=getnext(j))
			fin[j]=c[i];
	for(i=1;i<n;i++)
		printf("%d\n",fin[i]);
	fclose(stdout);
	return 0;
}