#include <fstream>
#include <cstring>
using namespace std;

const int kMaxN = 10000005;
const int kBits = 8, kSize = 1 << kBits, kMask = kSize - 1;

int N, A, B, C;
int a[kMaxN], aux[kMaxN];

void Read() {
	ifstream fin("radixsort.in");
	fin >> N >> A >> B >> C;
	a[0] = B;
	for (int i = 1; i < N; ++i)
		a[i] = (1LL * A * a[i - 1] + B) % C;
}

inline int GetBucket(int x, int offset) {
	return (x >> offset) & kMask;
}

void CountSort(int *source, int *destination, int offset) {
	int cnt[kSize], indx[kSize];
	memset(cnt, 0, sizeof cnt);
	for (int i = 0; i < N; ++i)
		++cnt[GetBucket(source[i], offset)];
	indx[0] = 0;
	for (int i = 1; i < kSize; ++i)
		indx[i] = indx[i - 1] + cnt[i - 1];
	for (int i = 0; i < N; ++i)
		destination[indx[GetBucket(source[i], offset)]++] = source[i];
}

void RadixSort() {
	for (int i = 0; i * kBits < 32; ++i)
		if (i & 1)
			CountSort(aux, a, i * kBits);
		else
			CountSort(a, aux, i * kBits);
}

void Print() {
	ofstream fout("radixsort.out");
	for (int i = 0; i < N; i += 10)
		fout << a[i] << " ";
	fout << "\n";
}

int main() {
	Read();
	RadixSort();
	Print();
	return 0;
}