#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

#define nmax 1000010

int A[nmax], B[nmax], C[nmax], Next[nmax], Ans[nmax], N;

int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    int i, j;
    scanf("%i %i %i %i", &N, &A[1], &B[1], &C[1]);
    if(A[1] > B[1]) A[1] ^= B[1] ^= A[1] ^= B[1];
    for(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]) A[i] ^= B[i] ^= A[i] ^= B[i];
    }
    for(i = N - 1; i; i--)
        for(j = A[i]; j <= B[i]; )
            if(!Ans[j])
            {
                Ans[j] = C[i];
                Next[j] = B[i] + 1;
                j ++;
            }else j = Next[j];
    for(i = 1; i < N; i++) printf("%i\n", Ans[i]);
    return 0;
}