#include<iostream>
#include<fstream>
#include<vector>
#include <algorithm>
using namespace std;


long long getMax(long long arr[], long long n)
{
	long long max = arr[0];
	for (long long i = 1; i < n; i++)
		if (arr[i] > max)
			max = arr[i];
	return max;
}
 

void countSort(long long arr[], long long n, long long exp)
{ 
	long long output[n], i, count[10] = {0};
 
	for (i = 0; i < n; i++)
		count[(arr[i] / exp) % 10]++;
 
	for (i = 1; i < 10; i++)
		count[i] += count[i-1];
 
	for (i = n - 1; i >= 0; i--)
	{
		output[count[(arr[i] / exp) % 10] - 1] = arr[i];
		count[(arr[i] / exp) % 10]--;
	}
 
	for (i = 0; i < n; i++)
		arr[i] = output[i];
}
 

void radixsort(long long arr[], long long n)
{
	long long exp, m;
	m = getMax(arr, n);
 
	for (exp = 1; m/exp > 0; exp *= 10)
		countSort(arr, n, exp);
}


int main(){
	ifstream f("radixsort.in");
	ofstream g("radixsort.out");
	long long N,A,B,C;
	f>>N;
	f>>A;
	f>>B;
	f>>C;
	
	long long v[N];
	for (long long i=0;i<N;i++)
		if(i==0)
			v[i]=B;
		else
			v[i]=(A*v[i-1]+B)%C;
	
	radixsort(v,N);
	
	for (long long i=0;i<N;i+=10)
		if(N-i>10)
			g<<v[i]<<" ";
		else
			g<<v[i];
		
			
	
	
}