#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];
    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;
    }
    for (int i = N - 1; i >= 1; --i)
    {
        int s = min(A[i], B[i]);
        int d = max(A[i], B[i]);
        while (s <= d)
        {
            if (nexxt[s] == 0)
            {
                nexxt[s] = d + 1;
                sol[s] = C[i];
                ++s;
            }
            else
            {
                s = nexxt[s];
            }
        }
    }
    for (int i = 1; i < N; ++i)
        fout << sol[i] << "\n";
    return 0;
}