#include <cstdio>
using namespace std;

const int NMAX = 1000000;

inline int get_digit(const int value, const int base, const int exp) {
    return (value / exp) % base;
}

void radix_sort(int *A, const int len) {
    const int BASE = 1024;

    // max_A element
    int max_A = A[0], i;
    for (i = 1; i < len; i++)
        if (A[i] > max_A) max_A = A[i];

    int B[NMAX];
    for (unsigned long long exp = 1; exp < max_A; exp *= BASE) {
        int bucket[BASE] = {0};

        // Count elements by digit
        for (i = 0; i < len; i++)
            bucket[ get_digit(A[i], BASE, exp) ]++;

        // Add the count from behind to use later in ordering
        for (i = 1; i < BASE; i++)
            bucket[i] += bucket[i-1];

        // Put elements in order
        for (i = len-1; i >= 0; i--)
            B[ --bucket[ get_digit(A[i], BASE, exp) ] ] = A[i];

        // Copy elements from B to A
        for (i = 0; i < len; i++)
            A[i] = B[i];
    }
}

int main() {
    FILE * in = fopen("radixsort.in", "r");
    int N, A, B, C;
    fscanf(in, "%d%d%d%d", &N, &A, &B, &C);
    fclose(in);

    // Create array of elements
    int v[NMAX];
    v[0] = B;
    for (int i = 1; i < N; i++)
        v[i] = (A * v[i-1] + B) % C;

    radix_sort(v, N);

    // Output elements
    FILE * out = fopen("radixsort.out", "w");
    for (int i = 0; i < N; i += 10)
        #ifdef DEBUG
        printf("%d ", v[i]);
        #else
        fprintf(out, "%d ", v[i]);
        #endif
    fclose(out);

    return 0;
}