#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");

int rez[1000005];

struct Paduri{
    vector<int> padre;
    Paduri(int n){
        padre.resize(n+1, -1);
    }
    int rad(int a){
        if(padre[a] == -1)
            return a;
        else{
            padre[a] = rad(padre[a]);
            return padre[a];
        }
    }
    void join(int a, int b){
        a = rad(a);
        b = rad(b);
        if(a == b) return;
        padre[a] = b;
    }
};

struct ura{
    int st, dr, culoare;
};

ura op[1000005];

int main()
{
    int n, m, a, b, c;
    cin >> n;
    m = n-1;
    Paduri dsu(n);
    cin >> a >> b >> c;
    m--;
    if(a < b)
        swap(a, b);
    op[m].st = a;
    op[m].dr = b;
    op[m].culoare = c;
    while(m--){
        a = (1LL*a*(n-1-m))%n;
        b = (1LL*b*(n-1-m))%n;
        c = (1LL*c*(n-1-m))%n;
        if(a < b)
            swap(a, b);
        op[m].st = a;
        op[m].dr = b;
        op[m].culoare = c;
    }
    m = n-1;
    for(int i = 0; i < m; i++){
        a = op[i].st;
        b = op[i].dr;
        c = op[i].culoare;
        while(a <= b){
            if(rez[a] != 0)
                a = dsu.rad(a);
            rez[a] = c;
            a++;
        }
        dsu.join(a, b+1);
    }
    for(int i = 1; i <= n-1; i++)
        cout << rez[i] << '\n';
    return 0;
}