//
//  main.cpp
//  radixsort
//
//  Created by Eusebiu Rares on 01/05/2020.
//  Copyright © 2020 Eusebiu Rares. All rights reserved.
//

#include <iostream>
#include "fstream"

std::fstream in ("radixsort.in", std::ios::in) ;
std::fstream out ("radixsort.out", std::ios::out) ;

const int MV = 1e7 ;

int v[MV + 1] ;

namespace merge {

const int BASE = 1 << 8 ;
const int BASE_IND = BASE - 1 ;
int nr[BASE + 1] ;
int aux[MV + 1] ;

void sort(int vec[], int size, int shift) {
	if (shift == 32) {
		return ;
	}
	
	for (int i = 0 ; i < BASE ; ++ i) { nr[i] = 0 ; }
	
	for (int i = 0 ; i < size ; ++ i) {
		nr[(vec[i] >> shift) & BASE_IND] ++ ;
	}
	for (int i = 1 ; i < BASE ; ++ i) { nr[i] += nr[i - 1] ; }
	for (int i = 0 ; i < size ; ++ i) {
		aux[nr[((vec[i] >> shift) & BASE_IND) - 1] ++] = vec[i] ;
	}
	for (int i = 0 ; i < size ; ++ i) {
		vec[i] = aux[i] ;
	}
	sort(vec, size, shift + 8) ;
}

}

int main(int argc, const char * argv[]) {
	int n, A, B, C ; in >> n >> A >> B >> C ;
	v[0] = B ;
	for (int i = 1 ; i < n ; ++ i) {
		v[i] = (A * v[i - 1] + B) % C ;
	}
	merge::sort(v, n, 0) ;
	for (int i = 0 ; i < n ; i = i + 10) {
		out << v[i] << ' ' ;
	}
}