/*
    If you can't explain it simply, you don't understand it well enough.
*/
#include <cstdio>
#include <algorithm>

using namespace std;

const int Nmax = 1000010;

int n , i , j , jj;
int a[Nmax] , b[Nmax] , c[Nmax] , culoare[Nmax];
int nxt[Nmax];

int main()
{
    freopen("curcubeu.in","r",stdin);
    freopen("curcubeu.out","w",stdout);

    scanf("%d %d %d %d", &n, &a[1], &b[1], &c[1]); nxt[1] = 2;

    for (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;

    for (i = 1; i <= n; ++i)
    {
        nxt[i] = i + 1;
        if (a[i] > b[i]) swap(a[i] , b[i]);
    }

    for (i = n - 1; i ; --i)
        for (j = a[i]; j <= b[i];)
        {
            if (!culoare[j])
                culoare[j] = c[i];

            jj = j;
            j = nxt[j];
            nxt[jj] = max(nxt[jj] , b[i] + 1);
        }


    for (i = 1; i < n; ++i)
        printf("%d\n", culoare[i]);


    return 0;
}