#include<cstdio>
#include<iostream>
using namespace std;
int a[1000003],b[1000003],c[1000003],i,j,n,m,l,r,sol[1000003],nt[1000003];
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(i=2;i<=n-1;++i)
    {a[i]=(1LL*a[i-1]*i)%n;
     b[i]=(1LL*b[i-1]*i)%n;
     c[i]=(1LL*c[i-1]*i)%n;
    }
    for(i=n-1;i>0;--i)
    {l=min(a[i],b[i]);
     r=max(a[i],b[i]);
     j=l;
     while(j<=r)
        {if(sol[j]!=0)j=nt[j];
            else
            {sol[j]=c[i];
             nt[j]=r+1;
             j++;
            }
        }
    }
    for(i=1;i<n;++i)
       printf("%d\n",sol[i]);
}