#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define B 256

typedef struct vectorInt {
	int* data;
	int size;
	int capacity;
} vectInt;
typedef vectInt* vector;

vector vec_new(int initCap) {
	if(initCap < 10) {
		initCap = 10;
	}
	vector vect = (vector)malloc(sizeof(vectInt));
	vect->capacity = initCap;
	vect->size = 0;
	vect->data = (int*)malloc(vect->capacity * sizeof(int));
	return vect;
}

void vec_free(vector vect) {
	free(vect->data);
	free(vect);
}

void vec_push_back(vector vect, int val) {
	if(vect->size == vect->capacity) {
		vect->capacity = 2 * vect->capacity;
		int* newData = (int*)malloc(vect->capacity * sizeof(int));
		memcpy(newData, vect->data, vect->size * sizeof(int));
		free(vect->data);
		vect->data = newData;
	}
	vect->data[vect->size] = val;
	vect->size = vect->size + 1;
}

int main() {
	FILE* fin = fopen("radixsort.in", "r");
	int n;
	int a, b, c;
	fscanf(fin, "%d %d %d %d\n", &n, &a, &b, &c);
	fclose(fin);
	
	int* t = (int*)malloc(n * sizeof(int));
	int i;
	t[0] = b % c;
	for(i=1; i<n; i++) {
		t[i] = (a * 1LL * t[i - 1] + b) % c;
	}
	int maxCifra = 0;
	while(c > 0) {
		maxCifra++;
		c = c / B;
	}
	int base = 1;
	vector bucket[B];
	int buckSize[B];
	int* temp = (int*)malloc(n * sizeof(int));
	for(i=0; i<maxCifra; i++) {
		int j;
		for(j=0; j<B; j++) {
			buckSize[j] = 0;
		}
		for(j=0; j<n; j++) {
			buckSize[(t[j] / base) % B]++;
		}
		buckSize[0]--;
		for(j=1; j<B; j++) {
			buckSize[j] = buckSize[j] + buckSize[j - 1];
		}
		for(j=n-1; j>=0; j--) {
			int cifra = (t[j] / base) % B;
			temp[buckSize[cifra]] = t[j];
			buckSize[cifra]--;
		}
		for(j=0; j<n; j++) {
			t[j] = temp[j];
		}
		base = base * B;
	}

	FILE* fout = fopen("radixsort.out", "w");
	for(i=0; i<n; i+=10) {
		fprintf(fout, "%d ", t[i]);
	}
	fprintf(fout, "\n");
	
	fclose(fout);
	free(temp);
	free(t);
	return 0;
}