#include <fstream>
#include <cstring>
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(a[0])
#define get_byte(x) ((x>>(byte*8))&RADIX)
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int a[10000011],n;

void countsort(int A[], int B[], int byte) {
    int counter[1<<RADIX_SIZE];
    int index[1<<RADIX_SIZE];

    memset(counter, 0, sizeof(counter));

    for(int i = 0; i < n; i ++)
        ++counter[get_byte(A[i])];

    index[0] = 0;

    for(int i = 1; i < 1<<RADIX_SIZE; i ++)
        index[i] = index[i-1] + counter[i-1];

    for(int i = 0; i < n; i ++)
        B[index[get_byte(A[i])]++] = A[i];
}
void radixsort() {
    int *temp = new int[n]; // avem nevoie de un array ca spatiu temporar
    for (int i = 0; i < TOTAL_BYTES; i ++) {
        if(i % 2 == 0)
            countsort(a, temp, i);// sortez dupa byte-ul i
        else
            countsort(temp,a, i);
    }
}
int x,y,z,i;
int main()
{
    f>>n>>x>>y>>z;
    a[0]=y%z;
    for(i=1;i<n;i++)
        a[i]=(a[i-1]*x%z+y)%z;
    radixsort();
    for(i=0;i<n;i=i+10)
        g<<a[i]<<" ";
    return 0;
}