#include <bits/stdc++.h>
#define NMAX 1000000

using namespace std;

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

int A[NMAX + 5], B[NMAX + 5], C[NMAX + 5], N, nexxt[NMAX + 5], sol[NMAX + 5], j;

int main()
{
    fin >> N >> A[1] >> B[1] >> C[1];
    if (A[1] > B[1])
        swap(A[1], B[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]);
    }
    for (int i = N - 1; i >= 1; --i)
    {
        for (j = A[i]; j <= B[i]; ++j)
        {
            while (nexxt[j] != 0)
                j = nexxt[j];
            if (j > B[i])
                break;
            nexxt[j] = B[i] + 1;
            sol[j] = C[i];
        }
    }
    for (int i = 1; i < N; ++i)
        fout << sol[i] << "\n";
    return 0;
}