#include <fstream>
#include <vector>

using namespace std;

ifstream f("curcubeu.in");
ofstream g("curcubeu.out");

int main ()
{
    int n, i, j, left, right;
    f >> n;
    vector <int> colour (n + 1, 0), a(n), b(n), c(n), next (n + 1);
    f >> a[1] >> b[1] >> c[1];
    for (i = 2; i <= n - 1; i += 1)
    {
        a[i] = (a[i - 1] * i) % n;
        b[i] = (b[i - 1] * i) % n;
        c[i] = (c[i - 1] * i) % n;
    }
    for (i = 1; i <= n - 1; i += 1)
        next[i] = i;
    for (i = n - 1; i >= 1; i -= 1)
    {
        left = min (a[i], b[i]);
        right = max (a[i], b[i]);
        for (j = left; j <= right;)
        {
            if (next[j] != j) /// Secventa j...next[j] este ocupata
                j = next[j];
            else
                colour[j] = c[i], next[j] = right + 1, j += 1;
        }
    }
    for (i = 1; i <= n - 1; i += 1)
        g << colour[i] << '\n';
    return 0;
}