#include <fstream>
#include <cstring>
#define UNS int
#define Radix_size 8
#define radix_filter ((1<<Radix_size)-1)
#define make_nr(x) ((x>>(tip*Radix_size))&radix_filter)

using namespace std;

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

UNS n, i, j, a, b, c, v[10000005];
UNS tmp[10000005];

void aranj(UNS tip, UNS in[], UNS out[]) {
    UNS contor[(1<<Radix_size)], index[(1<<Radix_size)];
    memset(contor, 0, sizeof(contor));
    memset(index, 0, sizeof(index));

    for (i = 0; i < n; i++) {
        contor[make_nr(in[i])]++;
    }
    for (i = 1; i < (1<<Radix_size); i++)
        index[i] = index[i-1]+contor[i-1];
    for (i = 0; i < n; i++)
        out[index[make_nr(in[i])]++] = in[i];
}

void srt() {
    UNS i;
    for (i = 0; i < 4; i++)
        if (i%2==0)
            aranj(i,v, tmp);
        else aranj(i,tmp,v);
}

int main() {
    f >> n >> a >> b >> c;
    v[0] = b;
    for (i = 1; i < n; i++)
        v[i] = (v[i-1]*a+b)%c;
    srt();
    for (i = 0; i < n; i += 10)
        g << v[i] << ' ';
    return 0;
}