#include <fstream>
using namespace std;

ifstream f("curcubeu.in");
ofstream g("curcubeu.out");

const int nmax = 1000005;
int n, a, b, c;
int st[nmax], dr[nmax], C[nmax];
int Next[nmax]; // vectorul de elemente pe care il sarim cand facem solorarile invers
int sol[nmax];


int find_next(int pos){
    int aux = pos;
    while(Next[pos] != pos){
        pos = Next[pos];
    }
    int res = pos;
    pos = aux;
    while(Next[pos] != res){
        aux = Next[pos];
        Next[pos] = res;
        pos = aux;
    }
    return res;
}
int main(){
     f >> n >> a >> b >> c;
     st[1] = a;
     dr[1] = b;
     C[1] = c;
     for(int i = 2; i <= n - 1; i++){
        st[i] = (st[i - 1] * i) % n;
        dr[i] = (dr[i - 1] * i) % n;
        C[i] = (C[i - 1] * i) % n;
     }
    for(int i = 1; i <= n; i++){
        Next[i] = i;
    }
    Next[n] = 0;
    for(int i = n - 1; i >= 1; i--){
        for(int j = find_next(st[i]); j <= dr[i]; j = Next[j]){
            sol[j] = C[i];
            Next[j] = find_next(j + 1);
        }
    }
    for(int i = 1; i <= n - 1; i++){
        g << sol[i] << '\n';
    }
}