#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
using ll=long long;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
const ll Nmax=1e6+5;
ll a[Nmax],b[Nmax],p[Nmax],c[Nmax],sol[Nmax];
ll sef(ll x)
{
    if(p[x]==x)
    {
        return x;
    }
    p[x]=sef(p[x]);
    return p[x];
}
inline void unite(ll x,ll y)
{
    ll sef1=sef(x);
    ll sef2=sef(y);
    if(sef1!=sef2)
    {
        if(sef1<sef2)
        {
            swap(sef1,sef2);
        }
        p[sef2]=sef1;
    }
}
int main()
{
    ll n;
    fin>>n;
    fin>>a[1]>>b[1]>>c[1];
    for(ll i=2;i<=n-1;i++)
    {
        a[i]=(a[i-1]*i)%n;
        b[i]=(b[i-1]*i)%n;
        c[i]=(c[i-1]*i)%n;
        if(a[i]>b[i])
        {
            swap(a[i],b[i]);
        }
    }
    for(ll i=n-1;i>=1;i--)
    {
        ll j=a[i];
        while(j<=b[i])
        {
            if(sol[j]!=0)
            {
                j=sef(j)+1;
            }
            else
            {
                sol[j]=c[i];
                p[j]=j;
                if(j-1>=1 && sol[j-1]!=0)
                {
                    unite(j,j-1);
                }
                if(j+1<n && sol[j+1]!=0)
                {
                    unite(j,j-1);
                }
                j++;
            }
        }
    }
    for(ll i=1;i<n;i++)
    {
        fout<<sol[i]<<'\n';
    }
    return 0;
}