#include <cstdio>
#include <algorithm>
using namespace std;

struct cool
{
    int a,b,c;
};

int n,a1,b1,c1,i,j,T[1000005],p1,p2,col,sol[1000005];
cool v[1000005];

inline int nxt(int pos)
{
    if(T[pos]==0)
      return pos;
    T[pos]=nxt(T[pos]);
    return T[pos];
}

int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a1,&b1,&c1);
    v[1].a=a1;v[1].b=b1;v[1].c=c1;
    for(i=2;i<n;++i)
    {
        v[i].a=(1LL*v[i-1].a*i)%n;
        v[i].b=(1ll*v[i-1].b*i)%n;
        v[i].c=(1LL*v[i-1].c*i)%n;
    }
    for(i=n-1;i>=1;--i)
    {
        p1=min(v[i].a,v[i].b);
        p2=max(v[i].a,v[i].b);
        col=v[i].c;
        for(j=nxt(p1);j<=p2; j=nxt(j+1))
        {
            sol[j]=col;
            T[j]=p2+1;
        }
    }
    for(i=1;i<n;++i)
    printf("%d\n",sol[i]);

    return 0;
}