#include<stdio.h>
#define N 1000000
int n,a[N],b[N],c[N],m,next[N],t[N],i,cul[N],j,l,j2;
int multime(int k)
{if(t[k]!=k) t[k]=multime(t[k]);
 return t[k];}
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;}}
 n--
 for(i=n;i>=1&&n;i--)
 {j=next[multime(a[i])];
  if(!j)
  {cul[a[i]]=c[i];
   next[a[i]]=a[i]+1;   n--;
   j2=multime(a[i]-1);
   if(next[j2]){t[a[i]]=j2;next[j2]=a[i]+1;}
   j2=multime(a[i]+1);
   if(next[j2]) {j=next[t[a[i]]]=next[j2];t[j2]=t[a[i]];}
   else j=a[i]+1;}
  while(j<=b[i])
  {cul[j]=c[i];        n--;
   l=t[j]=multime(j-1);
   j2=multime(j+1);
   if(next[j2]) {j=next[j2];t[j2]=l;}
   else j++;
   next[l]=j;}
 }
 for(i=1;i<n;i++) printf("%d\n",cul[i]);
 fclose(stdout);
 return 0;}