#include <cstdio>

const int NMAX = 1000001;

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

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);
    register 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]);
        if(A[i] > B[i])
        {
            int aux = A[i];
            A[i] = B[i];
            B[i] = aux;
        }
    }
    for(i = N - 1; i > 0; i--)
        for(j = A[i]; j <= B[i];)
            if(cul[j] == 0)
            {
                cul[j] = C[i];
                urm[j] = B[i] + 1;
                j++;
            }
            else
                j = urm[j];
    for(i = 1; i < N; i++)
        printf("%d\n", cul[i]);
}