#include<cstdio>
#define NMAX 1000004
using namespace std;
int a[NMAX],b[NMAX],c[NMAX],n,t[NMAX],col[NMAX];
inline int min (int a, int b)
{
    if (a<b) return a;
    return b;
}
inline int max (int a, int b)
{
    if (a>b) return a;
    return b;
}
int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
    for(int i=2;i<=n;i++)
     {a[i]=((long long)a[i-1]*i)%n;
      b[i]=((long long)b[i-1]*i)%n;
      c[i]=((long long)c[i-1]*i)%n;     
      int aux=min(a[i],b[i]);
      b[i]=max(a[i],b[i]);
      a[i]=aux;}
    for(int i=1;i<=n;i++) { t[i]=i+1; col[i]=-1;}
    for(int i=n-1;i>=1;i--)        
       {
	 for(int j=a[i];j<=b[i];)
         {
	   if(col[j]==-1)
           col[j]=c[i];
           int aux=j;
           j=t[j];
           t[aux]=b[i]+1;
         }
       } 
    for(int i=1;i<=n-1;i++)
    if(col[i]==-1) printf("0\n");
    else printf("%d\n",col[i]);            
    return 0;
}