#include <fstream>

using namespace std;

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

unsigned int N, A1, B1, C1;

unsigned long long int A[1000001], B[1000001], C[1000001];
unsigned int i, j;

unsigned long long int sol[1000001];

int main ()
{
    /// READ
    fin >> N >> A1 >> B1 >> C1;

    /// SOLVE
    A[1] = A1;
    B[1] = B1;
    C[1] = C1;
    for (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 (i=1; i<=N; i++)
        for (j=min(A[i],B[i]); j<=max(A[i],B[i]); j++)
            sol[j] = C[i];

    /// PRINT TEST
    /*
    for (i=1; i<=N; i++)
        fout << A[i] << ' ';
    fout << '\n';
    for (i=1; i<=N; i++)
        fout << B[i] << ' ';
    fout << '\n';
    for (i=1; i<=N; i++)
        fout << C[i] << ' ';
    fout << '\n';
    for (i=1; i<=N; i++)
        fout << sol[i] << ' ';
    fout << '\n';
    */

    /// PRINT
    for (i=1; i<=N-1; i++)
        fout << sol[i] << '\n';
    return 0;
}