#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");
const int Nmax = 1e6 + 1;
int n, a[Nmax], b[Nmax], c[Nmax];
int parent[Nmax];
int findroot(int node)
{
    if(node == parent[node])
        return node;
    parent[node] = findroot(parent[node]);
    return parent[node];
}
int color[Nmax];
int32_t main()
{
    cin >> n >> a[1] >> b[1] >> c[1];

    iota(parent + 1, parent + n + 1, 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 > 0 ; i--)
    {
        if(a[i] > b[i])
            swap(a[i], b[i]);
        int st = findroot(a[i]);
        while(st <= b[i])
        {
            color[st] = c[i];
            parent[st] = b[i] + 1;
            st = findroot(st + 1);
        }
    }
    for(int i = 1; i < n; i++)
        cout << color[i] << '\n';
    return 0;
}