#include <iostream>
#include <vector>
#include <tuple>

using namespace std;

using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char* x) { cout << '\"' << x << '\"'; }
void __print(const string& x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V>& x) { cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}'; }
template<typename T>
void __print(const T& x) { int f = 0; cout << '{'; for (auto& i : x) cout << (f++ ? "," : ""), __print(i); cout << "}"; }
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << ", "; _print(v...); }
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

vector<tuple<ll,ll,ll>> v(1'000'001);
ll ans[1'000'001], colored[1'000'001];

int available(int& j){
    // if(!colored[j]) return j;
    int next=colored[j];
    while(next!=colored[next]){
        next=colored[next];
    }
    int aux=next,a;
    next=colored[j];
    while(next!=colored[next]){
        a=next;
        next=colored[next];
        colored[a]=aux;
    }
    return aux;
}

void solve()
{
    ll n,a,b,c;
    cin>>n>>a>>b>>c;
    v[1]=tie(a,b,c);
    colored[1]=1;
    for(int i=2; i<n; i++){
        a=(a*i)%n;
        b=(b*i)%n;
        c=(c*i)%n;
        v[i]=tie(min(a,b),max(a,b),c);
        colored[i]=i;
    }
    colored[n]=n;
    ll a,b,c;
    for(int i=n-1; i>0; i--){
        tie(a,b,c)=v[i];
        for(int j=a; j<=b; j++){
            j=available(j);
            if(j<=b && !ans[j]){
                ans[j]=c;
                colored[j]=available(j+1);
            }
            colored[j]=max(colored[j],b);
        }
    }
    for(int i=1; i<n; i++){
        cout<<ans[i]<<nl;
    }
}

int main()
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
        solve();
    return 0;
}