#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("curcubeu.in");
ofstream out("curcubeu.out");
const int maxn = 1000005;
int ind[maxn];
int v[maxn];
struct upd
{
    int a, b, c;
};
upd u[maxn];

inline upd make_update(int A, int B, int C)
{
    upd aux;
    aux.a = A;
    aux.b = B;
    aux.c = C;
    return aux;
}

void update(upd x)
{
    int A = x.a;
    int B = x.b;
    if(A > B)
        swap(A, B);
    int C = x.c;
    int p = A;
    while(p <= B)
    {
        if(v[p] == 0)
        {
            v[p] = C;
            ind[p] = B + 1;
            p++;
        }
        else
            p = ind[p];
    }
}

int main()
{
    int n, A, B, C;
    in >> n >> A >> B >> C;
    u[1] = make_update(A, B, C);
    for(int i = 2; i < n; i++)
    {
        A = (1LL * A * i) % n;
        B = (1LL * B * i) % n;
        C = (1LL * C * i) % n;
        u[i] = make_update(A, B, C);
    }
    for(int i = 1; i <= n; i++)
        ind[i] = i + 1;
    reverse(u + 1, u + n);
    for(int i = 1; i < n; i++)
        update(u[i]);
    for(int i = 1; i <= n - 1; i++)
        out << v[i] << "\n";
    return 0;
}