#include <iostream>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
ifstream in("curcubeu.in");
ofstream g("curcubeu.out");

int N, A[1000001], B[1000001], C[1000001], f[1000001], r[1000001], cul[1000001];

int Find(int x)
{
    int y, z;
    for(y = f[x]; y != f[y]; y = f[y]);
    while(x != f[x])
    {
        z = f[x];
        f[x] = y;
        x = z;
    }
    return y;
}

void Union(int x, int y)
{
    if(r[x] <= r[y])
        f[x] = y;
    else f[y] = x;
    if(r[x] == r[y])
        ++r[y];
}

int main()
{
    in >> N >> A[1] >> B[1] >> C[1];
    if(A[1] > B[1])swap(A[1], B[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;
        if(A[i] > B[i])swap(A[i], B[i]);
    }
    for(int i = 1; i <= N; i++)
    {
        f[i] = i;
        r[i] = 1;
    }
    for(int i = N - 1; i > 0; i--)
    {
        int j = Find(A[i]);
        while(j <= B[i])
        {
            if(cul[j] == 0)
            {
                cul[j] = C[i];
                Union(j, B[i]);
            }
            j = Find(++j);
        }
    }
    for(int i = 1; i < N; i++)
        g << cul[i] << '\n';
    return 0;
}