#include <cstdio>

const int NMAX = 1000001;
int N, A[NMAX], B[NMAX], C[NMAX], T[NMAX], cul[NMAX];
int Find(int x)
{
    int y = x;
    for(; 0 != T[y]; y = T[y]);
    while(0 != T[x])
    {
        int z = T[x];
        T[x] = y;
        x = z;
    }
    return y;
}
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 j;
    scanf("%d%d%d%d", &N  , &A[1] , &B[1] , &C[1]);
    if(A[1] > B[1])
        swap(A[1], B[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;
        if(A[i] > B[i])
            swap(A[i], B[i]);
    }
    for(int 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(int i = 1; i < N; i++)
        printf("%d\n" , cul[i]);
    return 0;
}