#include <bits/stdc++.h>
#define cin ci
#define cout co
#pragma GCC optimize("03,unroll-loops")
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n, a1, b1, c1;
vector<int> a, b, c;
vector<int> par;
int findroot(int node)
{
    if(node == par[node])
        return node;
    return par[node] = findroot(par[node]);
}

int main()
{
    cin >> n >> a1 >> b1 >> c1;
    a.resize(n + 5);
    b.resize(n + 5);
    c.resize(n + 5);
    par.resize(n + 5);
    for(int i = 1; i <= n; i ++)
    {
        par[i] = i;
    }
    a[1] = a1, b[1] = b1, c[1] = c1;
    for(int i = 2; i < n; i ++)
    {
        a[i] = (1ll * a[i - 1] * i) % n;
        b[i] = (1ll * b[i - 1] * i) % n;
        c[i] = (1ll * c[i - 1] * i) % n;
    }
    vector<int> ans(n + 5);
    for(int i = n - 1; i >= 1; i --)
    {
        int color = c[i];
        int dr = max(b[i], a[i]);
        int st = min(b[i], a[i]);

        st = findroot(st);
        while(st <= dr)
        {
            ans[st] = c[i];
            par[st] = dr + 1;

            st = findroot(st + 1);
        }

    }
    for(int i = 1; i < n; i ++)
        cout << ans[i] << '\n';
    return 0;
}