#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

vector<int> nexts;

int poola(int x) {
    int root = x;

    while (nexts[root] != root)
        root = nexts[root];

    while (nexts[x] != x) {
        int aux = nexts[x];
        nexts[x] = root;
        x = aux;
    }

    return root;
}

int main() {
    int n;
    long long a, b, c;

    cin >> n >> a >> b >> c;

    vector<int> l(n + 1);
    vector<int> r(n + 1);
    vector<int> x(n + 1);
    vector<int> ans(n + 1);

    for (int i = 1; i < n; i++) {
        a = (a * i) % n;
        b = (b * i) % n;
        c = (c * i) % n;

        l[i] = (int)a;
        r[i] = (int)b;
        x[i] = (int)c;
    }

    // n + 1 este santinela
    nexts.resize(n + 2);

    for (int i = 0; i <= n + 1; i++)
        nexts[i] = i;

    for (int i = n - 1; i >= 1; i--) {
        int st = min(l[i], r[i]);
        int dr = max(l[i], r[i]);

        int j = poola(st);

        while (j <= dr) {
            ans[j] = x[i];

            // eliminăm poziția j
            nexts[j] = poola(j + 1);

            j = poola(j);
        }
    }

    for (int i = 1; i < n; i++)
        cout << ans[i] << '\n';

    return 0;
}