#include <cstdio>
const int N = 1000005;
int n, a, b, c, t[N];

struct tip{int st, dr, c, cl;} v[N];

int inline min(int a, int b) {
    return a < b ? a : b;
}

int inline max(int a, int b) {
    return a > b ? a : b;
}

int inline root(int x) {
    int r, y;
    for(r = x; r != t[r]; r = t[r]);

    for(;x != r; ) {
        y = t[x];
        t[x] = r;
        x = y;
    }

    return r;
}

inline void unite(int x, int y) {
    t[x] = y;
}

int main() {
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    int i;
    scanf("%d %d %d %d", &n, &a, &b, &c);
    for(i = 1; i < n; ++i) {
        v[i].st = min(a, b);
        v[i].dr = max(a, b);
        v[i].c = c;
        a = ((long long)a * (i + 1)) % n;
        b = ((long long)b * (i + 1)) % n;
        c = ((long long)c * (i + 1)) % n;
    }

    int nr = n - 1, rl, rd, j;

    for(i = 1; i <= n; ++i)
        t[i] = i;

    for(i = n - 1; i >= 1 ; --i) {


        rd = root(v[i].dr);

        for(j = v[i].st; j <= v[i].dr; ++j){
            if(t[j] == j) {
                v[j].cl = v[i].c;
            }
			else 
				j = root(j);
			unite(j, rd);
        }

	}

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

    return 0;
}