#include <fstream>
#include <iostream>
#include <cstring>
using namespace std;
 
ifstream f("radixsort.in");
ofstream g("radixsort.out");
 
const int NMAX = 10000005;
const int BASE = (1<<8);
unsigned int v[NMAX], N, backup[NMAX], counter[BASE], index[BASE];
 
 
int main()
{
     
    f>>N;
 
    int A,B,C;
    f>>A>>B>>C;
     
    int i,j,k;
     
    v[1]=B;
     
    unsigned int bestN = v[1];
    for(i=2;i<=N;i++)
    {
        v[i]=(1LL*A*v[i-1]+B)%C;
    }
     
    for(int shift=0; shift<=24; shift+=8 )
    {
		
		memset(counter,0,sizeof(counter));
        for(i=1;i<=N;i++)
		{
			counter[(v[i]>>shift) & (BASE-1)]++;
			backup[i]=v[i];
		}
         
		for(index[0]=1,i=1;i<BASE;i++) //index[0]=1 da sens vect
			index[i]=index[i-1]+counter[i-1];
		
        for(i=1;i<=N;i++)
		{
			v[index[(backup[i]>>shift) & (BASE-1)]]=backup[i];
			index[(backup[i]>>shift) & (BASE-1)]++;
		}
    }
     
    for(i=1;i<=N;i+=10)
        g<<v[i]<<' ';
     
}