#include <bits/stdc++.h>
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int fr[256];

int main() {
    int N, A, B, C;
    f >> N >> A >> B >> C;
    int myarray[N+1], aux[N+1];
    myarray[1] = B;
    for(int i = 2; i <= N; i++) {
        myarray[i] = (1LL * A * myarray[i - 1] + B) % C;
    }

    for(int p = 0; p < 32; p += 8) {
        for(int i = 0; i < 256; i++)
            fr[i] = 0;

        for(int i = 1; i <= N; i++)
            fr[(myarray[i] >> p) & 255]++;

        for(int i = 1; i < 256; i++)
            fr[i] += fr[i - 1];

        for(int i = N; i >= 1; i--)
            aux[fr[(myarray[i] >> p) & 255]--] = myarray[i];

        for(int i = 1; i <= N; i++)
            myarray[i] = aux[i];
    }

    for(int i = 1; i <= N; i += 10)
        g << myarray[i] << " ";
    return 0;
}