#include <bits/stdc++.h>

using namespace std;

//#define f cin
//#define g cout
//ifstream f("data.in");
//ofstream g("data.out");
ifstream f("curcubeu.in");
ofstream g("curcubeu.out");

const int dim = 1e6 + 2;
const int mod = 1e9 + 7;

long long n, a[dim], b[dim], c[dim];
int sol[dim];

int inv[dim];

int main(){
    f >> n >> a[1] >> b[1] >> c[1];

    int i, j;

    for(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(i = n - 1; i > 0; --i){
        if(a[i] < b[i])
            for(j = a[i]; j <= b[i]; ++j){
                if(inv[j] == 0){
                    sol[j] = c[i];
                    inv[j] = b[i];
                } else j = inv[j];
            }
        else for(j = b[i]; j <= a[i]; ++j){
                if(inv[j] == 0){
                    sol[j] = c[i];
                    inv[j] = a[i];
                } else j = inv[j];
            }
    }

    for(i = 1; i < n; ++i)
        g << sol[i] << '\n';

    return 0;
}