#include <bits/stdc++.h>
using namespace std;
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");
int n,aux,pos;
vector<int>a,b,c,parent,color;
int findRoot(int node)
{
    if(parent[node]==node)
        return node;
    return parent[node]=findRoot(parent[node]);
}
int main()
{
    f>>n;
    a.resize(n+1);
    b.resize(n+1);
    c.resize(n+1);
    parent.resize(n+1);
    color.resize(n+1);
    f>>a[1]>>b[1]>>c[1];
    if(a[1]>b[1])
    {
        aux=a[1];
        a[1]=b[1];
        b[1]=aux;
    }
    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;
        if(a[i]>b[i])
        {
            aux=a[i];
            a[i]=b[i];
            b[i]=aux;
        }
    }
    for(int i=0; i<=n; i++)
        parent[i]=i;
    for(int i=n-1; i>=1; i--)
    {
        pos=findRoot(a[i]);
        while(pos<=b[i])
        {
            color[pos]=c[i];
            parent[pos]=b[i]+1;
            pos=findRoot(pos+1);
        }
    }
    for(int i=1; i<n; i++)
        g<<color[i]<<'\n';
    return 0;
}