#include <fstream>
using namespace std;
int v[10000001];
ifstream f("radixsort.in");
ofstream g("radixsort.out");


void print(int v[], int n)
{
    for(int i=0;i<n;i+=10)
        g << v[i] << " ";
}

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

void countSort(int arr[], int n, int exp)
{
	int output[n];
	int i, count[10] = {0};

	for (i = 0; i < n; i++)
		count[ (arr[i]/exp)%10 ]++;

	// Change count[i] so that count[i] now contains actual
	// position of this digit in output[]
	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(int arr[], int n)
{
	int m = getMax(arr, n);
	for (int exp = 1; m/exp > 0; exp *= 10)
		countSort(arr, n, exp);
}


int main()
{
    int N,A,B,C;
    f >> N >> A >> B>> C;
    v[0] = B;
    for (int i=1;i<N;i++)
        v[i] = (1LL * A*v[i-1] % C +B)%C;
    radixsort(v,N);
    print(v,N);


}