#include <stdio.h>
#include <cstring>
#define MAX (10000000 + 1)
#define STEP 10
#define get_byte(n, b) ((n >> (b * 8)) & 255)

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


void sort_after_byte(int * v, int * b, int byte)
{
    for (int i = 1; i <= N; ++i)
    {
        ++f[get_byte(v[i], byte)];      
    }
    
    for (int i = 1; i <= 255; ++i)
    {
        f[i] += f[i-1];
    }
    
    for (int i = N; i >= 1; --i)
    {
        b[f[get_byte(v[i], byte)]] = v[i];
        --f[get_byte(v[i], byte)];
    }
}

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 % C;
    for (int i = 2; i <= N; ++i)
    {
        v[i] = (A * v[i-1] + B) % C;
    }

    for (int i = 0; i < 4; ++i)
    {
        if (i%2)
        {
            sort_after_byte(b, v, i);
        }
        else
        {
            sort_after_byte(v, b, i) ;
        }
    }
    
    // Afisare rezultat
    for (int i = 1; i <= N; i+=STEP)
    {
        printf("%d ", v[i]);
    }

    return 0;
}