#include<cstdio>
#define M 60000000
int v[2][10000001],i,j,d[256],e[256],l,o=-1,n,a,b,c;
char r[M];
int A()
{
  	int s=0;
  	for(o++;r[o]>='0'&&r[o]<='9';o++)
  		s=s*10+r[o]-'0';
  	return s;
}
void S(int x)
{
    int i,d=x>999999999?10:x>99999999?9:x>9999999?8:x>999999?7:x>99999?6:x>9999?5:x>999?4:x>99?3:x>9?2:1;
    for(i=d-1;i>=0;x/=10,i--)
        r[l+i]=x%10+48;
    r[l+d]=32,l+=d+1;
}
int main()
{
    freopen("radixsort.in","r",stdin),freopen("radixsort.out","w",stdout),fread(r,1,50,stdin),n=A(),a=A(),b=A(),c=A();
    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++)
    {
        for(i=0;i<256;i++)
        	d[i]=0;
        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)
        S(v[0][i]);
    fwrite(r,1,l,stdout);
}