#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n, x, y, z;
vector<long long> a, b, c, col, parent;
int findroot(int node)
{
    if(node == parent[node])
        return node;
    parent[node] = findroot(parent[node]);
    return parent[node];
}
int main()
{
    cin >> n;
    a.resize(n+1);
    b.resize(n+1);
    c.resize(n+1);
    col.resize(n+1);
    parent.resize(n+1);
    cin >> a[1] >> b[1] >> c[1];
    for(int i=1; i<=n; i++)
        parent[i] = i;
    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;
    }
    for(int i=n-1; i>=1; i--)
    {
        if(a[i] > b[i])
            swap(a[i], b[i]);

        int st = findroot(a[i]);
        while(st <= b[i])
        {
            parent[st] = b[i] + 1;
            col[st] = c[i];

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