#include <algorithm>
#include <cstring>
#include <fstream>
 
using namespace std;
  
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(V[0])
 
int N;
int V[10000000];
 
#define get_byte(x) ((x>>(byte * 8)) & RADIX)
 
void countsort(int A[], int B[], int byte) {
    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 *temp = new int[N]; // avem nevoie de un array ca spatiu temporar
    for (int i = 0; i < TOTAL_BYTES; i ++) {
        if(i % 2 == 0)
            countsort(V, temp, i);// sortez dupa byte-ul i
        else
            countsort(temp, V, i);
    }
}
  
int main(){	
	int a,b,c;
 
	FILE* f= fopen("radixsort.in","rt");
	FILE* g= fopen("radixsort.out","wt");
	fscanf(f,"%d %d %d %d",&N,&a,&b,&c);
	 
	V[0]=b;
 
	for(int i=1;i<N;i++){
		V[i]=((1LL * a * V[i-1]) % c + b) % c;
	}
 
	radixsort();
 
	for(int i=0;i<N;i+=10)
		fprintf(g,"%d ",V[i]);

	fclose(g);
	fclose(f);
 
	return 0;   
}