#include<stdio.h>
#define NMAX 1000000

int A[NMAX],B[NMAX],C[NMAX],ANS[NMAX],NEXT[NMAX];

inline int min(const int a,const int b)
{
	return a<b?a:b;
}
inline int max(const int a,const int b)
{
	return a>b?a:b;
}

int main()
{
	freopen("curcubeu.in","r",stdin);
	freopen("curcubeu.out","w",stdout);

	int N;
	scanf("%d",&N);
	scanf("%d%d%d",&A[1],&B[1],&C[1]);
	
	int i;
	for(i=2; i<N; ++i)
	{
		A[i]=(A[i-1]*i)%N;
		B[i]=(B[i-1]*i)%N;
		C[i]=(C[i-1]*i)%N;
	}

	int begin,end;
	for(i=N-1; i; --i)
	{
		begin=min(A[i],B[i]);
		end=max(A[i],B[i]);
		
		for(; begin<=end; ++begin) 
		{
			if( !ANS[ begin ] )
			{
				ANS[begin]=C[i];
				NEXT[begin]=end+1;
			}
			else
				begin=NEXT[begin];
		}
	}

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

	return 0;
}