#include<stdio.h>
#include<fstream>
using namespace std;

ifstream f("curcubeu.in");
FILE *g = fopen("curcubeu.out","w");

#define MaxN 1000100

int N,A,B,C,D[MaxN],cul[MaxN];

int min(void)
{
	return A < B ? A : B;
}

int max(void)
{
	return A > B ? A : B;
}

int main()
{
	f >> N >> A >> B >> C;
	
	for(int i=1;i<N;i++)
	{
		A = (1LL*A*i)%N;
		B = (1LL*B*i)%N;
		C = (1LL*C*i)%N;
		
		A = min();
		B = max();
		
		for(int j=A;j<=B;D[j] ? j = D[j] : j ++)
			!D[j] ? D[j] = B+1,cul[j] = C : 0;
	}
	
	for(int i=1;i<N;i++)
		fprintf(g,"%d\n",cul[i]);
	
	return 0;	
}