#include <fstream>

using namespace std;

const int NMax = 1000010;

int n;
int a[NMax], b[NMax], c[NMax];
bool colored[NMax];
int comp[NMax];
int ans[NMax];

inline int find(int x)
{
    int root, y;
    root = x;
    for (; root != comp[root]; root = comp[root]);
    for (; comp[x] != root; y = comp[x], comp[x] = root, x = y);
    return root;
}

int main()
{
    ifstream f ("curcubeu.in");
    f>>n>>a[1]>>b[1]>>c[1];
    f.close();
    if (a[1] > b[1])
        swap(a[1], b[1]);
    for (int i = 1; i <= n; ++i)
        comp[i] = i;
    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 - 1; i >= 1; --i)
    {
        for (int j = a[i]; j <= b[i];)
        {
            if (!colored[j])
            {
                colored[j] = true;
                ans[j] = c[i];
                comp[j] = b[i] + 1;
                ++j;
            }
            else
                j = find(j);
        }
    }
    ofstream g("curcubeu.out");
    for (int i = 1; i < n; ++i)
        g<<ans[i]<<"\n";
    g.close();

    return 0;
}