#include <stdio.h>
#define NMAX 1000002
using namespace std;
int n,a[NMAX],b[NMAX],c[NMAX],v[NMAX],col[NMAX],i,aux,x,d;
int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);
    scanf("%d %d %d %d",&n,&a[1],&b[1],&c[1]);
    if (a[i]>b[1])
    {
       aux=a[1];
       a[1]=b[1];
       b[1]=aux;
    }
    v[1]=1;
    for (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;
        if (a[i]>b[i])
        {
           aux=a[i];
           a[i]=b[i];
           b[i]=aux;
        }
        v[i]=i;
    }
    v[n]=n;
    for (i=n-1;i;--i)
    {
        aux=v[a[i]];
        d=aux;
        while (aux!=v[aux] && aux<n)
              aux=v[aux];
        while (d!=aux)
        {
              v[d]=aux;
              d=v[d];
        }
        while (aux<=b[i])
        {
              col[aux]=c[i];
              x=v[aux+1];
              d=x;
              while (x!=v[x] && x<n)
                    x=v[x];
              while (d!=x)
              {
                    v[d]=x;
                    d=v[d];
              }
              v[aux]=v[b[i]+1];
              aux=x;
        }
    }
    for (i=1;i<n;++i)
        printf("%d\n",col[i]);
    return 0;
}