#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n, a, b, c, p, v[10000001], x[10000001], s[256];
int main() {
    fin >> n >> a >> b >> c;
    v[1] = b;
    for (int i = 2; i <= n; i++) {
        v[i] = (1LL * a * v[i-1] + b) % c;
    }
    int maxc = v[1];
    for (int i = 2; i <= n; i++) {
        if (v[i] > maxc) maxc = v[i];
    }
    int nrc = 0;
    while (maxc > 0) {
        nrc++;
        maxc >>= 8;
    }
    for (int k = 0; k < nrc; k++) {
        for (int i = 0; i < 256; i++) s[i] = 0;
        for (int i = 1; i <= n; i++) s[(v[i] >> p) & 255]++;
        for (int i = 1; i < 256; i++) s[i] += s[i-1];
        for (int i = n; i >= 1; i--) {
            x[s[(v[i] >> p) & 255] - 1] = v[i];
            s[(v[i] >> p) & 255]--;
        }
        for (int i = 1; i <= n; i++) v[i] = x[i-1];
        p += 8;
    }
    for (int i = 1; i <= n; i += 10) {
        fout << v[i] << " ";
    }
    return 0;
}