#include <stdlib.h>
#include <stdio.h>
#include <string.h>

#define MAX_N 10000000 + 1
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(numbers[0])

int numbers[MAX_N];

#define get_byte(x) ((x>>(byte * 8))&RADIX)

void countsort(int A[], int B[], int byte, int n) {

    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 n) {

    int *temp =(int*)malloc(sizeof(int) * n); // avem nevoie de un array ca spatiu temporar

    for (int i = 0; i < TOTAL_BYTES; i ++) {
        if(i % 2 == 0)
            countsort(numbers, temp, i, n);// sortez dupa byte-ul i
        else
            countsort(temp, numbers, i, n);

    }
}

void read(FILE* in, int* n) {

    int a,b,c;

    fscanf(in, "%d %d %d %d", n, &a, &b, &c);
    numbers[0] = b % c;

    for(int i = 1; i < *n; i ++)
        numbers[i] = (1LL * a * numbers[i-1] % c + b) % c;

}

void write(FILE* out, int n) {

    for(int i = 0; i < n; i +=10)
        fprintf(out, "%d ", numbers[i]);

    fprintf(out, "\n");

}



int main() {


    FILE* in = fopen("radixsort.in", "r");
    FILE* out = fopen("radixsort.out", "w");
    int n;
    read(in, &n);

    radixsort(n);

    write(out, n);

    return 0;

}