#include <cstdio>
#include <fstream>

#define MAX (1 << 20)

using namespace std;

int n, a[MAX], b[MAX], c[MAX], jump[MAX], sol[MAX];

int main()
{
    freopen("curcubeu.in", "r", stdin); scanf("%d %d %d %d", &n, &a[1], &b[1], &c[1]); fclose(stdin);
    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 = n; i; i--)
    {
        for(int j = a[i]; j <= b[i];)
        {
            if(!sol[j])
            {
                sol[j] = c[i];
                jump[j] = b[i] + 1;
                j++;
            }
            else
                j = jump[j];
        }
    }
    freopen("curcubeu.out", "w", stdout);
    for(int i = 1; i < n; i++) printf("%d\n", sol[i]);
    fclose(stdin);
    return 0;
}