#include <iostream>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <list>
#include <bitset>
using namespace std;

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

const int dim = 1000010;
bitset <dim> am_cul;

int n,parent[dim],ans[dim],a[dim],b[dim],c[dim],start[dim],cate[dim];

int Find(int x)
{
    if (x == parent[x])
    {
        return x;
    }
    return parent[x] = Find(parent[x]);
}

int Next(int x)
{
    int rx = Find(x);
    return (start[rx] + cate[rx]);
}

void Union(int x,int y)
{
    int rx = Find(x);
    int ry = Find(y);

    if (rand() & 1)
    {
        parent[rx] = ry;
        cate[ry] += cate[rx];
        start[ry] = min(start[ry] , start[rx]);
    }
    else
    {
        parent[ry] = rx;
        cate[rx] += cate[ry];
        start[rx] = min(start[rx],start[ry]);
    }
}

int main()
{
    int i,j;
    in >> n >> a[1] >> b[1] >> c[1];
    for (i=1; i<n; i++)
    {
        parent[i] = i;
        cate[i] = 1;
        start[i] = i;
    }
    int a_nou,b_nou,c_nou;
    for (i=2; i<=n-1; 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;
    }

    int st,dr;


    int x;
    for (i=n-1; i>= 1; i--)
    {
        st = min(a[i],b[i]);
        dr = max(a[i],b[i]);
        x = st;
        if (am_cul[x] == 1)
        {
            x = Find(x);
        }

        while (x <= dr)
        {
            am_cul[x] = 1;
            ans[x] = c[i];

            if (x > 1 && am_cul[x-1])
            {
                Union(x-1,x);
            }
            if (x < n-1 && am_cul[x+1])
            {
                Union(x,x+1);
            }
            x = Next(x);
        }

    }
    for (i=1; i<=n-1; i++)
    {
        out << ans[i] << "\n";
    }
    return 0;
}