#include <bits/stdc++.h>

using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
int n,root[1000005],a[1000005],b[1000005],c[1000005],dr[1000005],sz[1000005],sol[1000005];
int getroot(int x)
{
    while(root[x]!=x)
        x=root[x];
    return x;
}
void join(int x, int y)
{
    int rx=getroot(x), ry=getroot(y);
    if(sz[rx]<sz[ry])
        swap(rx, ry);
    sz[rx]+=sz[ry];
    root[ry]=rx;
    dr[rx]=max(dr[rx], dr[ry]);
}
int main()
{
    fin>>n>>a[1]>>b[1]>>c[1];
    sz[1]=1; dr[1]=1; root[1]=1;
    for(int i=2; i<n; i++)
    {
        sz[i]=1;
        dr[i]=1;
        a[i]=(a[i-1]*i)%n;
        b[i]=(b[i-1]*i)%n;
        c[i]=(c[i-1]*i)%n;
        root[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[getroot(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[getroot(j);
            }
        }
    }
    for(int i=1; i<n; i++)
        fout<<sol[i]<<"\n";
}