#include<cstring>
#include<fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
#define RADIX 0xFF
int n,v[10000001],a,b,c,i,*t,r;
void C(int a[],int b[],int y)
{
    int counter[1<<8],index[1<<8],i;
    memset(counter,0,sizeof(counter));
    for(i=0;i<n;i++)
        ++counter[(a[i]>>(y*8))&RADIX];
    index[0]=0;
    for(i=1;i<1<<8;i++)
        index[i]=index[i-1]+counter[i-1];
    for(i=0;i<n;i++)
        b[index[(a[i]>>(y*8))&RADIX]++]=a[i];
}
int main()
{
    f>>n>>a>>b>>c;
    v[0]=b%c;
    for(i=1;i<n;i++)
        v[i]=(1LL*a*v[i-1]%c+b)%c;
    t=new int[n];
    r=sizeof(v[0]);
    for(i=0;i<r;i++)
        if(i%2==0)
            C(v,t,i);
        else
            C(t,v,i);
    for(i=0;i<n;i+=10)
        g<<v[i]<<' ';
}