#include <bits/stdc++.h>

using namespace std;
int n, A, B, C;
vector<int> a, b, c;
vector<int> parent, grad;
struct disjoint
{
    void init()
    {
        for(int i = 1; i <= n; i++)
        {
            parent[i] = i;
            grad[i] = 1;
        }
    }
    int findroot(int node)
    {
        if(node == parent[node])
            return node;
        parent[node] = findroot(parent[node]);
        return parent[node];
    }
} dsu;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> A >> B >> C;
    a.resize(n + 5);
    b.resize(n + 5);
    c.resize(n + 5);
    vector<int> ans(n + 5, 0);
    parent.resize(n + 5);
    grad.resize(n + 5);
    a[1] = A, b[1] = B, c[1] = C;
    for(int i = 2; i <= n; i++)
    {
        a[i] = (a[i - 1] * i) % n;
        b[i] = (b[i - 1] * i) % n;
        c[i] = (c[i - 1] * i) % n;
    }
    dsu.init();
    for(int i = n; i >= 1; i--)
    {
        if(a[i] > b[i])
            swap(a[i], b[i]);
        int st = dsu.findroot(a[i]), dr = b[i];
        while(st <= dr)
        {
            ans[st] = c[i];
            parent[st] = b[i] + 1;
            st = dsu.findroot(st + 1);
        }
    }
    for(int i = 1; i < n; i++)
        cout << ans[i] << '\n';
    return 0;
}