#include<stdio.h>
#include<string.h>
int v[2][10000001],i,n,j,d[256],e[256];
long long a,b,c;
int main()
{
    freopen("radixsort.in","r",stdin),freopen("radixsort.out","w",stdout),scanf("%d%lld%lld%lld",&n,&a,&b,&c);
    for(v[0][0]=b,i=1;i<n;++i)
        v[0][i]=(a*v[0][i-1]+b)%c;
    for(j=0;j<4;++j) {
        memset(d,0,sizeof(d));
        for(i=0;i<n;++i)
            ++d[(v[j&1][i]>>(j*8))&255];
        for(e[0]=0,i=1;i<256;++i)
            e[i]=e[i-1]+d[i-1];
        for(i=0;i<n;++i)
            v[(j+1)&1][e[(v[j&1][i]>>(j*8))&255]++]=v[j&1][i];
    }
    for(i=0;i<n;i+=10)
        printf("%d ",v[0][i]);
    return 0;
}