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

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

vector<int> nxt;

int find(int x) {
    if (nxt[x] == x)
        return x;
    return nxt[x] = find(nxt[x]);
}

int main() {
    int n, 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] = min(a, b);
        r[i] = max(a, b);
        x[i] = c;
    }

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

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

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

        int j = find(st);

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

            // j nu mai este disponibil
            nxt[j] = find(j + 1);

            j = find(j);
        }
    }

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

    return 0;
}