#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;

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()
{ifstream f ("radixsort.in");
ofstream g ("radixsort.out");
int N,A,B,C,v[10000002];
f>>N;
f>>A;
f>>B;
f>>C;
int i;
v[0]=B;
for(i=1;i<N;i++)
    v[i] = (A * v[i-1] + B) % C;
radixsort(v,N);
for(i=0;i<N;i+=10)
    g<<v[i]<<" ";


}