#include <fstream>
#define nmax 1000005
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n,a[nmax],b[nmax],c[nmax];
int dr[nmax],l[nmax],t[nmax],sol[nmax];
int radacina(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}
void join(int x,int y)
{
    int rx=radacina(x);
    int ry=radacina(y);
    if(rx==ry)
        return ;
    if(l[rx]<l[ry])
        swap(rx,ry);
    l[rx]+=l[ry];
    t[ry]=rx;
    dr[rx]=max(dr[rx],dr[ry]);
}
int main()
{
    cin>>n>>a[1]>>b[1]>>c[1];
    l[1]=1;
    dr[1]=1;
    t[1]=1;
    for(int i=2; i<n; 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;
        l[i]=1;
        dr[i]=i;
        t[i]=i;
    }
    for(int i=n-1; i>=1; i--)
        for(int j=min(a[i],b[i]); j<=max(a[i],b[i]); j++)
        {
            if(sol[j]!=0)
                j=dr[radacina(j)];
            else
            {
                sol[j]=c[i];
                if(sol[j-1]!=0)
                    join(j,j-1);
                if(sol[j+1]!=0)
                    join(j,j+1);
                j=dr[radacina(j)];
            }
        }

    for(int i=1; i<n; i++)
        cout<<sol[i]<<'\n';
    return 0;
}