#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

const int NMAX = 1000000 + 5;

int n;
int a[NMAX], b[NMAX], c[NMAX], v[NMAX];

void read()
{
    fin >> n >> a[1] >> b[1] >> c[1];
    for (int i = 2; i < n; ++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;
        if (a[i] > b[i])
            swap(a[i], b[i]);
    }
}

int main()
{
    read();
    for (int i = 1; i < n; ++i)
    {
        for (int j = a[i]; j <= b[i]; ++j)
        {
            v[j] = c[i];
        }
    }
    for (int i = 1; i < n; ++i)
    {
        fout << v[i] << '\n';
    }
    return 0;
}