#include <bits/stdc++.h>
#define nmax 1000003
using namespace std;
int A[nmax], B[nmax], C[nmax], d[nmax], urm[nmax];
int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    int n, i, j, mn, mx;
    scanf("%d", &n);
    scanf("%d%d%d", A + 1, B + 1, C + 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;
        urm[i - 1] = i;
    }
    for (i = n - 1; i >= 1; i --)
    {
        mn = min(A[i], B[i]);
        mx = max(A[i], B[i]);
        for (j = mn; j <= mx; )
            if (d[j] == 0)
            {
                d[j] = C[i];
                urm[j] = mx + 1;
                j++;
            }
            else j = urm[j];
    }
    for (i = 1; i < n; i ++)
        printf("%d\n", d[i]);
    return 0;
}