#include <bits/stdc++.h>
using namespace std;
const int dim=1e6+5;
int n,a[dim],b[dim],c[dim],sol[dim],nxt[dim];
int main(){
    ifstream f("curcubeu.in");
    ofstream g("curcubeu.out");
    f>>n>>a[1]>>b[1]>>c[1];
    for(int i=2;i<n;i++){
        a[i]=(a[i-1]*i)%n;
        b[i]=(b[i-1]*i)%n;
        c[i]=(c[i-1]*i)%n;
    }
    n--;
    for(int i=1;i<=n;i++){
        nxt[i]=i+1;
        if(a[i]>b[i]){
            swap(a[i],b[i]);
        }
    }
    for(int i=n;i>=1;i--){
        int p=a[i];
        while(p<=b[i]){
            if(!sol[p]){
                sol[p]=c[i];
            }
            p=nxt[p];
        }
        int cp=p;
        p=a[i];
        while(p<=b[i]){
            int cpp=p;
            p=nxt[p];
            nxt[cpp]=cp;
        }
    }
    for(int i=1;i<=n;i++){
        g<<sol[i]<<'\n';
    }
    return 0;
}