#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int MAXN = 10000000;
int v[MAXN + 5];
int aux[MAXN + 5];
int fv[256];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, a, b, c;
    cin >> n >> a >> b >> c;

    v[0] = 0;
    for (int i = 1; i <= n; ++i) {
        long long nr = (1LL * v[i-1] * a + b) % c;
        v[i] = static_cast<int>(nr);
    }

    for (int shift = 0; shift < 32; shift += 8) {
        fill(fv, fv + 256, 0);

        for (int i = 1; i <= n; ++i) {
            int byte = (v[i] >> shift) & 255;
            fv[byte]++;
        }

        for (int i = 1; i < 256; ++i) {
            fv[i] += fv[i - 1];
        }

        for (int i = n; i >= 1; --i) {
            int byte = (v[i] >> shift) & 255;
            aux[fv[byte]--] = v[i];
        }

        for (int i = 1; i <= n; ++i) {
            v[i] = aux[i];
        }
    }

    for (int i = 1; i <= n; i += 10) {
        cout << v[i] << ' ';
    }

    return 0;
}