#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 10000002
#define TOTAL_BYTES sizeof(Array[0])
#define RADIX_SIZE 8
#define RADIX 0xFF
#define get_byte(x) x>>(byte*8) & RADIX
using namespace std;

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

void countsort(int A[], int B[], int byte, int n) {
	int counter[1 << RADIX_SIZE];
	int index[1 << RADIX_SIZE];
	memset(counter, 0, sizeof(counter));
	for (int i = 0; i < n; i++) {
		counter[get_byte(A[i])]++;
	}
	index[0] = 0;
	for (int i = 1; i < 1 << RADIX_SIZE; i++) {
		index[i] = index[i - 1] + counter[i - 1];
	}
	for (int i = 0; i < n; i++) {
		B[index[get_byte(A[i])]++] = A[i];
	}
}

void radixsort(int Array[], int n) {
	int* temp = new int[n];
	for (int i = 0; i < TOTAL_BYTES; i++) {
		if (i % 2 == 0) {
			countsort(Array, temp, i, n);
		}
		else {
			countsort(temp, Array, i, n);
		}
	}
}

int main()
{
	int* myArray = new int[NMAX];
	int n, a, b, c;
	ifstream fin("radixsort.in");
	ofstream fout("radixsort.out");
	fin >> n >> a >> b >> c;
	myArray[0] = b % c;
	for (int i = 1; i < n; i++) {
		myArray[i] = ((1LL * a * myArray[i - 1]) + b) % c;
 	}
	radixsort(myArray, n);
	for (int i = 0; i < n; i+=10) {
		fout << myArray[i] << " ";
	}
	fout.close();
}