#include <bits/stdc++.h>
using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");
const int NMAX=1e6;
vector<int> a(NMAX+5), b(NMAX+5), c(NMAX+5), parent(NMAX+5), ans(NMAX+5);
int find_set(int nod){
    if(nod==parent[nod]){
        return nod;
    }
    return parent[nod]=find_set(parent[nod]);
}
int main(){
    int n;
    fin>>n>>a[1]>>b[1]>>c[1];
    if(a[1]>b[1]){
        swap(a[1],b[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;
        if(a[i]>b[i]){
            swap(a[i],b[i]);
        }
    }
    for(int i=0;i<=n;i++){
        parent[i]=i;
    }
    for(int i=n-1;i>=1;i--){
        int pos=find_set(a[i]);
        while(pos<=b[i]){
            ans[pos]=c[i];
            parent[pos]=b[i]+1;
            pos=find_set(pos+1);
        }
    }
    for(int i=1;i<=n-1;i++){
        fout<<ans[i]<<'\n';
    }
}