#include <bits/stdc++.h>
#define cin ci
#define cout co
#define int long long
using namespace std;

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

int n, A, B, C;
vector<int> a, b, c;
vector<int> parent;

struct disjoint
{
    void init()
    {
        for(int i = 1; i <= n + 1; i++)
            parent[i] = i;
    }
    int findroot(int node)
    {
        if(parent[node] == node)
            return node;
        return parent[node] = findroot(parent[node]);
    }
} dsu;

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> A >> B >> C;

    a.resize(n + 2);
    b.resize(n + 2);
    c.resize(n + 2);
    parent.resize(n + 2);

    vector<int> ans(n + 2, 0);

    a[1] = A;
    b[1] = B;
    c[1] = C;

    for(int i = 2; i <= n - 1; 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;
    }

    dsu.init();

    for(int i = n - 1; i >= 1; i--)
    {
        if(a[i] > b[i])
            swap(a[i], b[i]);

        int st = a[i];
        int dr = b[i];

        st = dsu.findroot(st);
        while(st <= dr)
        {
            ans[st] = c[i];
            parent[st] = b[i] + 1;
            st = dsu.findroot(st + 1);
        }
    }

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

    return 0;
}