#include <iostream>
#include <fstream>
using namespace std;

const int NMAX = 1000001;

int A[NMAX], B[NMAX], C[NMAX], cul[NMAX], T[NMAX], N;

int Find(int i)
{
    if(T[i] == 0)
        return i;
    return T[i] = Find(T[i]);
}

inline void Union(int x, int y)
{
    if(x != y) T[x] = y;
}

int main()
{
    ifstream cin("curcubeu.in");
    ofstream cout("curcubeu.out");
    int i, j;
    cin >> N >> A[1] >> B[1] >> C[1];
    if(A[1] > B[1])
        swap(A[1], B[1]);
    for(i = 2; i < N; i++)
    {
        A[i] = (1LL * i * A[i - 1]) % N;
        B[i] = (1LL * i * B[i - 1]) % N;
        C[i] = (1LL * i * C[i - 1]) % N;
        if(A[i] > B[i])
            swap(A[i], B[i]);
    }
    for(i = N - 1; i >= 1; i--)
    {
        j = Find(A[i]);
        while(j <= B[i])
        {
            if(cul[j] == 0)
            {
                cul[j] = C[i];
                Union(j, B[i]);
            }
            j = Find(++j);
        }
    }
    for(i = 1; i < N; i++)
        cout << cul[i] << '\n';
    return 0;
}