#include <iostream>
#include <cstdio>
#define MAXN 1000050

using namespace std;

int n, a[MAXN], b[MAXN], c[MAXN];
int sol[MAXN], skip[MAXN], tip[MAXN];

int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);

    scanf("%d %d %d %d", &n, &a[1], &b[1], &c[1]);
    if (b[1] < a[1]) swap(a[1], b[1]);
    skip[1] = 2;
    for (int i = 2; i < n; i++) {
        a[i] = (1LL * a[i-1] * i) % n;
        b[i] = (1LL * b[i-1] * i) % n;
        if (b[i] < a[i]) swap(a[i], b[i]);
        c[i] = (1LL * c[i-1] * i) % n;
        skip[i] = i+1;
    }
    for (int i = n-1; i >= 1; i--) {
        for (int j = a[i]; j <= b[i];) {
            if (sol[j]) {
                j = skip[tip[j]];
            }
            else {
                sol[j] = c[i];
                tip[j] = i;
                skip[i] = (++j);
            }
        }
    }
    for (int i = 1; i < n; i++)
        printf("%d\n", sol[i]);


    return 0;
}