#include<cstdio>
#include<queue>

using namespace std;

FILE *fin,*fout;

int n,a,b,c,p2[4]={(1<<8),(1<<16),(1<<24)};
queue<int> radix[2][256];

int main()
{
	fin=fopen("radixsort.in","r");
	fout=fopen("radixsort.out","w");
	fscanf(fin,"%d %d %d %d",&n,&a,&b,&c);
	int ant=b,l=0;
	for(int i=1;i<=n;i++)
	{
		radix[0][ant%256].push(ant);
		ant=(1LL*a*ant+b)%c;
	}
	
	for(int i=0;i<3;i++,l=1-l)
		for(int k=0,val;k<256;k++)
			for(;!radix[l][k].empty();radix[l][k].pop())
			{
				val=radix[l][k].front();
				radix[1-l][ (val/p2[i])%256 ].push(val);
			}
	
	for(int k=0,i=1;k<256;k++)
		for(;!radix[l][k].empty();radix[l][k].pop(),i++)
			if(i%10==1)
				fprintf(fout,"%d ",radix[l][k].front());
	
	fclose(fin);
	fclose(fout);
	
	return 0;
}