#include <bits/stdc++.h>
#define MAX_N 1000005

using namespace std;
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

int n,a,b,c;
array<int, MAX_N> tatici;
array<int, MAX_N> colorat;
array<int, MAX_N> leftSide;
array<int, MAX_N> rightSide;
array<int, MAX_N> color;
int getNext(int k) {
    int mem = k;
    while(tatici[k] != mem) {
        k = tatici[k];
    }
    while(tatici[mem] != k) {
        const int aux = tatici[mem];
        tatici[mem] = k;
        mem = aux;
    }
    return k;
}

int main() {
    fin >> n;


    fin >> leftSide[1] >> rightSide[1] >> color[1];
    for(int i = 1; i < MAX_N; i++) {
        tatici[i] = i;
    }
    for(int i = 2; i < n; i++) {

        leftSide[i] = (1ll*leftSide[i-1]*i) % n;
        rightSide[i] = (1ll*rightSide[i-1]*i) % n;
        color[i] = (1ll*color[i-1]*i) % n;
    }

    for (int i = n-1; i > 0; i--) {

        const int _left = min(leftSide[i],rightSide[i]);
        const int _right = max(leftSide[i],rightSide[i]);
        for (int k = _left; k <= _right; k++) {
            colorat[k] = color[i];
            tatici[k] = getNext(k+1);
        }
    }
    for (int i = 1; i < n; i++) {
        fout << colorat[i] << '\n';
    }

    return 0;
}