#include<stdio.h>
#include<algorithm>
#define MAXN 1000005
#define LL long long
using namespace std;
LL N,A[MAXN],B[MAXN],C[MAXN],D[MAXN],n[MAXN];
int main() {
	freopen("curcubeu.in","r",stdin);
freopen("curcubeu.out","w",stdout);
	  LL i,j,R,x;
	  scanf("%lld %lld %lld %lld",&N,&A[1],&B[1],&C[1]);
	  n[1]=1;
	  for(i=2;i<=N-1;i++)
	     { A[i]=(A[i-1]*i)%N;
	       B[i]=(B[i-1]*i)%N;
	       C[i]=(C[i-1]*i)%N;
		   n[i]=i;        }
	 for(i=N-1;i>=1;i--) {
	 				j=min(A[i],B[i]);
					 while(j<=max(A[i],B[i])) {	 
	 		    //gasim prima casuta necolorata  R
				 for(R=j;n[R]!=n[R] && R<=max(A[i],B[i]);R=n[R])
				 //compresia drumurilor
				  for(;n[j]!=j;) {
				     	x=n[j];                             
						n[j]=R;
						j=x; 		  
	 					 }
					while(D[j]==0 && j<=max(A[i],B[i])) {
								 D[j]=C[i];
								 j++;
								 }
				 }//end while
}//end for			 			 								    	  	 					 
	  for(i=1;i<=N-1;i++)
	       printf("%lld\n",D[i]);
	return 0;
}