#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];
int main() {
	freopen("curcubeu.in","r",stdin);
freopen("curcubeu.out","w",stdout);
	  LL i,j;
	  scanf("%lld %lld %lld %lld",&N,&A[1],&B[1],&C[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; }
	 for(i=N-1;i>=1;i--)
	          for(j=min(A[i],B[i]);j<=max(A[i],B[i]);j++)
	                                if(D[j]==0) D[j]=C[i];
	  for(i=1;i<=N-1;i++)
	       printf("%lld\n",D[i]);
	return 0;
}