#include<stdio.h>
using namespace std;
int n, v[10000002],B[10000002];
const int RADIX=(1<<15)-1;
void countsort(int byte) {
    int i;
    int counter[RADIX+1];
    int index[RADIX+1];
    for(i=0;i<=RADIX;i++)
        counter[i]=0;
    for(int i = 0; i < n; i ++)
        ++counter[(v[i]>>byte)&RADIX];

    index[0] = 0;

    for(int i = 1; i <= RADIX; i ++)
        index[i] = index[i-1] + counter[i-1];

    for(int i = 0; i < n; i ++)
        B[index[(v[i]>>byte)&RADIX]++] = v[i];

    for(int i = 0; i < n; i ++) v[i]=B[i];
}
void radixsort() {
    for (int i = 0; i < 32; i +=16)
        countsort(i);
}
int main()
{
    int a, b, c, i;
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[0] = b % c;
    for(i = 1; i < n; i++)
        v[i] = (1ll * a * v[i-1]+1ll * b) % c;
    radixsort();
    for(i = 0; i < n; i+=10)
    printf("%d ",v[i]);
}