#include <stdio.h>
using namespace std;
long n,a,b,c,x[1000001];
inline long min(long a,long b)
{
 return a<b ? a : b;
}
inline long max(long a,long b)
{
 return a>b ? a : b;
}
int main()
{
 freopen("curcubeu.in","r",stdin);
 freopen("curcubeu.out","w",stdout);
 scanf("%ld %ld %ld %ld\n",&n,&a,&b,&c);
 long i,j;
 for (i=min(a,b);i<=max(a,b);i++)
  x[i]=c;
 for (j=2;j<n;j++)
 {
  a=(a*j)%n;
  b=(b*j)%n;
  c=(c*j)%n;
  for (i=min(a,b);i<=max(a,b);i++)
   x[i]=c;
 }
 for (i=1;i<n;i++)
  printf("%ld\n",x[i]);
 return 0;
}