#include<stdio.h>
#define N 1000000
int n,a[N],b[N],c[N],m,next[N],t[N],rang[N],i,cul[N],j,l,j2;
int multime(int k)
{if(t[k]!=k) t[k]=multime(t[k]);
 return t[k];}
void uneste(int i,int j)
{i=multime(i);
 j=multime(j);
 if(i==j) return;
 if(rang[i] < rang[j])t[i]=j;
 else t[j]=i;
 if(rang[i]==rang[j]) rang[i]++;}

int main()
{freopen("curcubeu.in","r",stdin);
 freopen("curcubeu.out","w",stdout);
 scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
 t[1]=1;
 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;
  t[i]=i;
  if(a[i]>b[i]){j=a[i];a[i]=b[i];b[i]=j;}}
 m=n-1;
 for(i=n-1;i>=1&&m;i--)
 {j=next[multime(a[i])];
  if(!j)
  {cul[a[i]]=c[i];
   next[a[i]]=a[i]+1;
   j2=next[multime(a[i]+1)];
   if(j2) {uneste(a[i],a[i]+1);next[t[a[i]]]=j2;j=j2;}
   else j=a[i]+1;}
  while(j<=b[i])
  {cul[j]=c[i];
   t[j]=multime(j-1);
   next[t[j]]=j+1;
   j2=next[multime(j+1)];
   if(j2) {uneste(j,j+1);next[t[j]]=j2;j=j2;}
   else j++;}
 }
 for(i=1;i<n;i++) printf("%d\n",cul[i]);
 fclose(stdout);
 return 0;}