#include <cstdio>
using namespace std;

const int NMAX = 10000000;

int v[NMAX], u[NMAX], N;

inline int get_digit(const int value, const int base, const int exp) {
    return (value >> exp) & base;
}

void radix_sort() {
    const int BASE = (1 << 10) - 1;
    int BASE_EXP;
    for (BASE_EXP = 1; (1 << BASE_EXP) < BASE; BASE_EXP++);

    // max_v element
    long long max_v = v[0];
    for (int i = 1; i < N; i++)
        if (v[i] > max_v) max_v = v[i];

    int bucket[BASE];
    for (int exp = 0, i; (1LL << exp) < max_v; exp += BASE_EXP) {
        // Reinitialize the bucket
        for (i = 0; i <= BASE; i++)
            bucket[i] = 0;

        // Count elements by digit
        for (i = 0; i < N; i++)
            bucket[ get_digit(v[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 = N-1; i >= 0; i--)
            u[ --bucket[ get_digit(v[i], BASE, exp) ] ] = v[i];

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

int main() {
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);

    int A, B, C;
    scanf("%d%d%d%d", &N, &A, &B, &C);

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

    // Sort generated array
    radix_sort();

    // Output elements
    for (int i = 0; i < N; i += 10)
        printf("%d ", v[i]);
    printf("\n");

    return 0;
}