#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

int N;
int A, B, C;
int V[10000002];
vector<int> D[1 << 8];

void sortn(int shift)
{
    int mask = (1 << 8) - 1;
    for (int i = 1; i <= N; ++i)
        D[(V[i] >> shift) & mask].push_back(V[i]);
    V[0] = 0;
    for (int i = 0; i <= mask; ++i)
        for (auto it = D[i].begin(); it != D[i].end(); ++it)
            V[++V[0]] = *it;
    for (int i = 0; i <= mask; ++i)
        D[i].clear();
}

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

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

    V[1] = B;
    for (int i = 2; i <= N; ++i)
        V[i] = (1LL * A * V[i - 1] + B) % C;

    sortn(0);
    sortn(8);
    sortn(16);
    sortn(24);

    for (int i = 1; i <= N; i += 10)
        printf("%d ", V[i]);
    printf("\n");
}