#include <cstdio>
#include <deque>
using namespace std;

int v[10000000];

void RadixSort(int v[], int left, int right){
    deque<int> bucket[256];

    for(int j = 0; j < 4; j++){
        for(int i = left; i <= right; i++){
            bucket[(v[i] >> (8 * j)) & 255].push_back(v[i]);
        }int index = -1;

        for(int i = 0; i < 256; i++){
            while(!bucket[i].empty()){
                v[++index] = bucket[i].front();
                bucket[i].pop_front();
            }
        }
    }
}
int main(){

int N, A, B, C;

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

scanf("%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] + B) % C;
}RadixSort(v, 0, N-1);

for(int i = 0; i < N; i += 10){
    printf("%d ", v[i]);
}
return 0;
}