#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 1000000;
int A[NMAX + 5], B[NMAX + 5], C[NMAX + 5], color[NMAX + 5], urm[NMAX + 5], viz[NMAX + 5];
int main(){
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    int n, i, j;
    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 --)
        for (j = min(A[i], B[i]); j <= max(A[i], B[i]); ){
            if (color[j] == 0){
                color[j] = C[i];
                urm[j] = max(A[i], B[i]) + 1;
                j ++;
            }
            else
                j = urm[j];
        }
    for (i = 1; i < n; i ++)
        printf("%d\n", color[i]);
    return 0;
}