#include <fstream>
using namespace std;
 
ifstream fin("curcubeu.in");
ofstream fout("curcubeu.out");

int u[1000001];

int find(int x)
{
    int r = x, y;
    while (r < u[r])
        r = u[r];
    while (x != r)
    {
        y = u[x];
        u[x] = r;
        x = y;
    }
    return r;
}

struct {int l, r, c;} q[1000000];
int v[1000000];
 
int main()
{
    int n, i, a, b, c, j;
    fin >> n >> a >> b >> c;
    for (i = 1; i<n; i++)
    {
        a = (1ll*a*i)%n;
        b = (1ll*b*i)%n;
        c = (1ll*c*i)%n;
        q[i] = {min(a, b), max(a, b), c};
        u[i] = i;
    }
    u[n] = n;
    for (i = n-1; i>=1; i--)
        for (j = find(q[i].l); j <= q[i].r; j = find(j))
        {
            v[j] = q[i].c;
            u[j] = j+1;
        }
    for (i = 1; i<n; i++)
        fout << v[i] << '\n';
    return 0;
}