#include <cstdio>

using namespace std;

const int NMAX = 10000000;

int a[1 + NMAX], b[1 + NMAX], c[1 + NMAX], v[1 + NMAX], t[1 + NMAX];

int find(int x) {
    while(x != t[x]) {
        x = t[x];
    }
    return x;
}

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

    int n;
    scanf("%d%d%d%d", &n, &a[1], &b[1], &c[1]);

    t[1] = 1;
    for(int i = 2; i <= n - 1; ++ 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;
        t[i] = i;
    }
    t[n] = n;

    for(int i = n - 1; i >= 1; -- i) {
        int st = a[i], dr = b[i];
        if(a[i] > b[i]) {
            st = b[i];
            dr = a[i];
        }

        st = find(st);
        while(st <= dr) {
            v[st] = c[i];
            t[st] = dr + 1;
            st = find(st + 1);
        }
    }

    for(int i = 1; i <= n - 1; ++ i) {
        printf("%d\n", v[i]);
    }

    return 0;
}