#include <bits/stdc++.h>
using namespace std;

int n, Next[1000005], sol[1000005], a[1000005], b[1000005], c[1000005];
inline int find_Next(int nod){
    if(Next[nod] == nod) return nod;
    int x = find_Next(Next[nod]);
    Next[nod] = x;
    return x;
}
int main() {
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    scanf("%d%d%d%d", &n, &a[1], &b[1], &c[1]);
    Next[1] = 1;
    for(int 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;
        Next[i] = i;
    }
    Next[n] = n;
    for(int i = n - 1; i >= 1 ; --i){
        if(a[i] > b[i]) swap(b[i], a[i]);
        int x = a[i];
        while(x <= b[i]){
            x = find_Next(x);
            if(x <= b[i]){
                sol[x] = c[i];
                Next[x] = Next[b[i] + 1];
            }
            ++x;
        }
        Next[a[i]] = Next[b[i] + 1];
    }
    for(int i = 1; i < n ; ++i)
        printf("%d\n", sol[i]);
    return 0;
}