#include <iostream>
#include <fstream>

using namespace std;

#define nmax 1000005
#define ll long long

ifstream f("curcubeu.in");

int n;
int next[nmax], rez[nmax];
int a[nmax], b[nmax], c[nmax];
int Min[nmax], Max[nmax];

void citeste(){

    f >> n >> a[1] >> b[1] >> c[1];
    Min[1] = min(a[1], b[1]);
    Max[1] = max(a[1], b[1]);

    for(int i=2; i<n; i++){
        a[i] = (1LL*a[i-1]*1LL*i)%n;
        b[i] = (1LL*b[i-1]*1LL*i)%n;
        c[i] = (1LL*c[i-1]*1LL*i)%n;
        Min[i] = min(a[i], b[i]);
        Max[i] = max(a[i], b[i]);
    }

}

void rezolva(){

    for(int i=1; i<=n; i++) next[i]=1LL*i;

    for(int i=n-1; i>=1; i--){
        for(int j=Min[i]; j<=Max[i]; ){
            if (rez[j]==0){
                next[j] = Max[i]+1;
                rez[j] = c[i];
                j++;
            }else j=next[j];
        }
    }

    for(int i=1; i<n; i++) printf("%d\n", rez[i]);

}

int main(){

    freopen("curcubeu.out", "w", stdout);

    citeste();
    rezolva();

    f.close();
    fclose(stdout);

    return 0;

}