#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 10000505;
const int LMAX = (1 << 8);

int N, A, B, C;
int nums[NMAX];

inline int getValue(int& value, int from, int toExclusive) {
	long long temp = ((1LL << toExclusive) - 1) & value;
	return temp >> from;
}

int main() {
	freopen("radixsort.in", "r", stdin);
	freopen("radixsort.out", "w", stdout);

	scanf("%d%d%d%d", &N, &A, &B, &C);
	nums[1] = B;
	for (int idx = 2; idx <= N; idx++) {
		nums[idx] = (1LL * nums[idx - 1] * A + B) % C;
	}

	for (int byteIdx = 0; byteIdx < 4; byteIdx++) {
		vector<vector<int>> orderedByByte(LMAX, vector<int>());
		for (int idx = 1; idx <= N; idx++) {
			int byteValue = getValue(nums[idx], byteIdx * 8, (byteIdx + 1) * 8);
			orderedByByte[byteValue].push_back(nums[idx]);
		}

		int nextPos = 1;
		for (int value = 0; value < LMAX; value++) {
			for (auto& entry : orderedByByte[value]) {
				nums[nextPos++] = entry;
			}
		}
	}

	for (int idx = 1; idx <= N; idx += 10) {
		printf("%d ", nums[idx]);
	}
	printf("\n");
	return 0;
}