#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

ifstream fin("curcubeu.in"); ofstream fout("curcubeu.out");
#define cin fin
#define cout fout

int n;
int a[1000010], b[1000010], c[1000010];
int res[1000010];

int32_t main(){
INIT
cin>>n>>a[1]>>b[1]>>c[1];
for(int 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;
}

set<pii> s;
s.insert(mp(1, n) );
s.insert(mp(n+1, n+1) );
int cnt=0;
for(int i=(n-1); (i>=1) && (cnt<n); i--){
    int l=min(a[i], b[i]), r=max(a[i], b[i]);
    int l0=n+1, r0=0;
    auto it=s.upper_bound(mp(l, r) ); if(it!=s.begin()){it--;}
    for(;it!=s.end();){
        int l1=it->ft, r1=it->sc;
        l0=min(l0, l1); r0=max(r1, r0);
        for(int j=max(l, l1); j<=min(r, r1); j++){
            cnt++; res[j]=c[i];
        }
        it=s.erase(it);
        if(r1>=r){break;}
    }

    if(r0>r){
        s.insert(mp(r+1, r0));
    }
    if(l0<l){
        s.insert(mp(l0, l-1) );
    }

}
for(int i=1; i<n; i++){
    cout<<res[i]<<"\n";
}


return 0;
}