#include <fstream>
#include <vector>
using namespace std;
ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");
int n;
vector<long long> a, b, c;
vector<int> parent, col;
int findroot(int node)
{
    if(node == parent[node])
        return node;
    parent[node] = findroot(parent[node]);
    return parent[node];
}
int main()
{
    cin >> n;
    col.resize(n+1);
    a.resize(n+1);
    b.resize(n+1);
    c.resize(n+1);
    parent.resize(n+1);
    for(int i=1; i<=n; i++)
        parent[i] = i;
    cin >> a[1] >> b[1] >> c[1];
    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 dr = findroot(a[i]);
        while(dr <= b[i])
        {
            parent[dr] = b[i] + 1;
            col[dr] = c[i];

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