#include<stdio.h>
#define NMAX 1000005
using namespace std;
int n;
int a[NMAX],b[NMAX],c[NMAX],urm[NMAX],cul[NMAX];
void inv(int i)
{ int aux;
	if(a[i]>b[i])
		{
		 	aux=a[i];
	 		a[i]=b[i];
	 		b[i]=aux;
			}
}
int main()
{ int i,k,j;
	freopen("curcubeu.in", "r", stdin);
	freopen("curcubeu.out", "w", stdout);
	scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
	inv(1);
	urm[1]=2;
	for(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;
		inv(i);
		urm[i]=i+1;
	}
	for(i=n-1;i>=1;i--)
		for(k=a[i];k<=b[i];j=k,k=urm[k],urm[j]=b[i]+1)
		{
			if(cul[k]==0)
				cul[k]=c[i];
		}
		for(i=1;i<=n-1;i++)
			printf("%d\n", cul[i]);
	return 0;
}