#include<cstring>
#include<fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(numbers[0])
int n,numbers[10000001],a,b,c,i,*temp;
#define get_byte(x) ((x>>(byte*8))&RADIX)
void countsort(int A[],int B[],int byte)
{
    int counter[1<<RADIX_SIZE],index[1<<RADIX_SIZE],i;
    memset(counter,0,sizeof(counter));
    for(i=0;i<n;i++)
        ++counter[get_byte(A[i])];
    index[0]=0;
    for(i=1;i<1<<RADIX_SIZE;i++)
        index[i]=index[i-1]+counter[i-1];
    for(i=0;i<n;i++)
        B[index[get_byte(A[i])]++]=A[i];
}
int main()
{
    f>>n>>a>>b>>c;
    numbers[0]=b%c;
    for(i=1;i<n;i++)
        numbers[i]=(1LL*a*numbers[i-1]%c+b)%c;
    temp=new int[n];
    for(i=0;i<TOTAL_BYTES;i++)
        if(i%2==0)
            countsort(numbers,temp,i);
        else
            countsort(temp,numbers,i);
    for(i=0;i<n;i+=10)
        g<<numbers[i]<<' ';
}