#include <fstream>
#include <string.h>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

#define MAX_N 10000000
#define MAX_BITS 32
#define BITS_PER_STEP 8
const int BASE = 1 << BITS_PER_STEP;
const int MASK = BASE - 1;


int v1[MAX_N], v2[MAX_N];
int poz[BASE], freq[BASE];


void radsort(int v[], int aux[], int n, int bits){
    if(bits == MAX_BITS){
        return;
    }

    int i;

    memset(freq, 0, sizeof(freq));

    for(i = 0; i < n; i++){
        ++freq[v[i] >> bits & MASK];
    }

    poz[0] = 0;
    for(i = 1; i < BASE; i++){
        poz[i] = freq[i - 1] + poz[i - 1];
    }

    for(i = 0; i < n; i++){
        aux[poz[v[i] >> bits & MASK]++] = v[i];
    }


    radsort(aux, v, n, bits + BITS_PER_STEP);
}

int main()
{
    int n, a, b, c, i;

    fin>>n>>a>>b>>c;

    v1[0] = b;
    for(i = 1; i < n; i++){
        v1[i] = (1LL * a * v1[i - 1] + b) % c;
    }

    radsort(v1, v2, n, 0);

    for(i = 0; i < n; i += 10){
        fout<<v2[i]<<" ";
    }

    fin.close();
    fout.close();
    return 0;
}