#include <bits/stdc++.h>
using namespace std;

ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

const int NMAX=1000005;
int n, aux, pos, i;
vector <int> a, b, c, parent, r;

int find_root(int x){
    if(x==parent[x]) return x;
    return parent[x]=find_root(parent[x]);
}

int main(){
    fin>>n;
    a.resize(n+1);
    b.resize(n+1);
    c.resize(n+1);
    parent.resize(n+1);
    r.resize(n+1);
    fin>>a[1]>>b[1]>>c[1];
    if(a[1]>b[1]){
        aux=b[1];
        b[1]=a[1];
        a[1]=aux;
    }
    for(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=b[i];
            b[i]=a[i];
            a[i]=aux;
        }
    }
    for(i=1;i<=n;i++)
        parent[i]=i;

    for(i=n-1;i>0;i--){
        pos=find_root(a[i]);
        while(pos<=b[i]){
            r[pos]=c[i];
            parent[pos]=b[i]+1;
            pos=find_root(pos+1);
        }
    }
    for(i=1;i<n;i++)
        fout<<r[i]<<endl;

    return 0;
}