#include <cstdio>

const int NMAX = 1000001;

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

int Find(int x)
{
    int v, rad = x;
    while(T[rad]) rad = T[rad];
    while(T[x] != 0)
    {
        v = T[x];
        T[x] = rad;
        x = v;
    }
    return rad;
}

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

inline void swap(int &a, int &b)
{
    a ^= b;
    b ^= a;
    a ^= b;
}

int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    int i, j;
    scanf("%d%d%d%d", &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++)
        printf("%d\n", cul[i]);
}