#include <bits/stdc++.h>

using namespace std;

int a[1001000];
int b[1001000];
int c[1001000];
int ret[1001000];
int x[1001000];

int main()
{
    freopen("curcubeu.in", "r", stdin);
    FILE *g = fopen("curcubeu.out", "w");

    int n;
    cin >> n >> a[1] >> b[1] >> c[1];
    for(int i = 2; i < n; i ++) {
        a[i] = a[i - 1] * i % n;
        b[i] = b[i - 1] * i % n;
        c[i] = c[i - 1] * i % n;
    }

    for(int i = n - 1; i > 0; i --) {
        int p = min(a[i], b[i]);
        int q = max(a[i], b[i]);
        for(int j = p; j <= q; j ++) {
            while(x[j])
                j = x[j];
            if(j <= q) {
                x[j] = q + 1;
                ret[j] = c[i];
            }
        }
    }

    for(int i = 1; i < n; i ++)
        fprintf(g, "%d\n", ret[i]);
    return 0;
}