#include <stdio.h>
#define MAX (1 << 20)
#define STEP 10

int N, A, B, C;
int v[MAX], f[MAX], s[MAX];

int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);
    
    scanf("%d %d %d %d", &N, &A, &B, &C);
    
    // Generam numerele
    v[1] = B;
    for (int i = 2; i <= N; ++i)
    {
        v[i] = (A * v[i-1] + B) % C;
    }

    // Sortare
    for (int i = 1; i <= N; ++i)
    {
        ++f[v[i]];
    }
    
    for (int i = 2; i <= MAX; ++i)
    {
        f[i] += f[i-1];
    }
    
    for (int i = 1; i <= N; ++i)
    {
        s[f[v[i]]] = v[i];
        --f[v[i]];
    }
    
    // Afisare rezultat
    for (int i = 1; i <= N; i+=STEP)
    {
        printf("%d ", s[i]);
    }

    return 0;
}