#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("radixsort.in");
ofstream fout ("radixsort.out");
int k=0;
void Counting_Sort(int A[],int B[],int n)
{
	int C[k+2];
	for(int i=0;i<k+1;i++)
	{
		C[i]=0;
	}
	for(int j=1;j<=n;j++)
	{
		C[A[j]]++;
	}
	for(int i=1;i<=k;i++)
	{
		C[i]+=C[i-1];
	}
	for(int j=n;j>=1;j--)
	{
		B[C[A[j]]]=A[j];
		C[A[j]]=C[A[j]]-1;
	}
}
int A[100000005],B[10000005];
int main()
{
	int n,a,b,c,q=1;
	fin>>n>>a>>b>>c;
    A[1]=b;
	for(int i=2;i<=n;i++){
		A[i]=(a*A[i-1]+b)%c;
		if(A[i]>k){
			k=A[i];
		}
	}
	Counting_Sort(A,B,n);
	for(int q=1;q<=n;q+=10){
		fout<<B[q]<<' ';
	}
	return 0;
}