#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int N;
int A, B, C;
int V[10000002], tmp[10000002];
int hman[1 << 8], done[1 << 8];

void sortn(int shift)
{
    memcpy(tmp, V, sizeof(tmp));

    const int mask = (1 << 8) - 1;

    for (int i = 0; i <= mask; ++i)
    {
        hman[i] = 0;
        done[i] = 1;
    }
    for (int i = 1; i <= N; ++i)
        ++hman[(V[i] >> shift) & mask];

    for (int i = 1; i <= mask; ++i)
        hman[i] += hman[i - 1];
    for (int i = 1; i <= N; ++i)
    {
        V[hman[((tmp[i] >> shift) & mask) - 1] + done[(tmp[i] >> shift) & mask]] = tmp[i];
        ++done[(tmp[i] >> shift) % mask];
    }
}

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");
}