#include <fstream>
#include <queue>

using namespace std;

int n, a, b, c, i, j, v[10000001], nrcif, maxi, p, iq, byte;
queue<int> q[256];
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int main() {
    fin >> n >> a >> b >> c;
    v[1] = b;
    for (i = 2; i <= n; i++) {
        v[i] = ((long long)a * v[i - 1] % c + b) % c;
    }
    for (byte = 0; byte <= 3; byte++) {
        for (i = 1; i <= n; i++) {        // pt fiecare element din vectorul v
            c = v[i] >> (byte * 8) & 255; // determinam cifra unitatilor/zecilor/sutelor etc.
            q[c].push(v[i]);              // si punem elementul v[i] la coada c
        }

        i = 0;
        for (iq = 0; iq <= 255; iq++)   // Punem elementele in v.
            while (not q[iq].empty()) { // cat timp exista coada de la "ghiseul" iq
                i++;
                v[i] = q[iq].front();
                q[iq].pop();
            }
    }
    for (i = 1; i <= n; i += 10)
        fout << v[i] << ' '; // se cere sa afisam elemente din 10 in 10
    return 0;
}

/*
        --------
11010011110100111101001111010011
    110100111101001111011111
--------        --------
                        11111111
                       1       0
        110100111101001111010011
                 110100111101001

*/