#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;
int multime(int k)
{if(t[k]!=k) t[k]=multime(t[k]);
 return t[k];}
void uneste(int x,int y,int next_)
{x=multime(x);
 y=multime(y);
 if(x==y) {next[t[x]]=next_;return;}
 if(rang[x] < rang[y])t[x]=y;
 else t[x]=x;
 if(rang[x]==rang[y]) rang[x]++;
 next[t[x]]=next_;}

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=a[i];
  while(j<=b[i])
  {if(!next[multime(j)])
    {cul[j]=c[i];m--;
     uneste(a[i],j,j+1);
     if(next[multime(j+1)])
      {uneste(j,j+1,next[j+1]);
       j=next[multime(j)];}
     else j++;}
    else j=next[j];
   }
 }
 for(i=1;i<n;i++) printf("%d\n",cul[i]);
 fclose(stdout);
 return 0;}