#include <fstream>
using namespace std;

ifstream cin("curcubeu.in");
ofstream cout("curcubeu.out");

int n;
int A[1000000], B[1000000], C[1000000];
int p[1000000];
int r[1000000];
int viz[1000000];

void Find(int x)
{
    int R, y;

    for(R = x; p[R] != R; R = p[R]);

    for(; p[x] != x;)
    {
        y = p[x];
        p[x] = R;
        x = y;
    }
}

void Unite(int x, int y)
{
    if(r[x] > r[y])
        p[y] = x;
    else
        p[x] = y;

    if(r[x] == r[y]) r[y]++;
}

int main()
{
    p[1] = 1;
    r[1] = 1;
    cin >> n >> A[1] >> B[1] >> C[1];
    for(int 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;
        p[i] = i;
        r[i] = 1;
    }
    p[n] = 0;

    for(int i = n-1; i>0; i--)
    {
        int st = min(A[i], B[i]);
        int dr = max(A[i], B[i]);

        for(int j = st; j <= dr; j = p[j] + 1)
        {
            if(viz[j] == 0)
            {
                viz[j] = C[i];
                Unite(j, dr);
            }
            Find(st);
        }
    }

    for(int i = 1; i<n; i++)
    {
        cout << viz[i] << '\n';
    }
}