// sursa Stefan Albu
#include <fstream>
#include <vector>

using namespace std;

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

int n, a1, b1, c1;
vector<int> a, b, c;
vector<int> parent;
vector<int> rez;

int root(int pos)
{
    if (parent[pos] == pos)
        return pos;
    parent[pos] = root(parent[pos]);
    return parent[pos];
}

int main()
{
    cin >> n >> a1 >> b1 >> c1;
    a.resize(n + 1);
    b.resize(n + 1);
    c.resize(n + 1);
    a[1] = a1, b[1] = b1, c[1] = c1;
    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;
    }
    parent.resize(n + 1);
    rez.resize(n + 1);

    for (int i = 0; i <= n; ++i)
        parent[i] = i;

    for (int i = n - 1; i >= 1; --i)
    {
        int left = min(a[i], b[i]), right = max(a[i], b[i]), color = c[i];
        for (int j = root(left); j <= right; j = root(j + 1))
        {
            rez[j] = color;
            parent[j] = right + 1;
        }
    }

    for (int i = 1; i <= n - 1; ++i)
    {
        cout << rez[i] << "\n";
    }
    return 0;
}