#include <stdio.h>
#include <stdlib.h>

FILE *f,*g;
long int N,A,B,C;
void read() {
    fscanf(f,"%ld %ld %ld %ld",&N,&A,&B,&C);
}
unsigned long biti(long int x,int n,int m){
    return (x>>n)&~(~0<<m);
}
void RadixSort(long int v[],int N) {
    int m=4;
int t[m*m];
long int T[N];
long int i,k;
    for(k=0;k<32/4;k++) {

        for(i=0;i<m*m;i++)
            t[i]=0;
        for(i=0;i<N;i++)
        t[biti(v[i],m*k,m)]++;
        for(i=1;i<m*m;i++)
            t[i]=t[i-1]+t[i];
        for(i=N-1;i>=0;i--) {
             T[t[biti(v[i],m*k,m)]-1]=v[i];
             t[biti(v[i],m*k,m)]--;
        }
       for(i=0;i<N;i++)
            v[i]=T[i];
    }
}
int main()
{
    f=fopen("radixsort.in","r");
    if(!f) {
        perror("Eorare");
        exit(EXIT_FAILURE);

    }
    read();
    long int v[N];
    v[0]=B;
    for(long int i=1;i<N;i++)
        v[i]=(A*v[i-1]+B)%C;
    g=fopen("radixsort.out","w");
    if(!g) {
        perror("Eorare");
        exit(EXIT_FAILURE);
    }
    RadixSort(v,N);
    for(long int i=0;i<N;i=i+10)
        fprintf(g,"%ld ",v[i]);
    return 0;
}