#include <cstdio>
#include <cmath>
#include <queue>
using namespace std;

int N, A, B, C, v[10000000], digits;

void RadixSort(int v[], int left, int right, int maxDigits){
    queue<int> bucket[10];
    int exponent = 1, remainder;

    while(maxDigits--){
        for(int i = left; i <= right; i++){
            remainder = v[i] / exponent % 10;
            bucket[remainder].push(v[i]);
        }int index = -1;

        for(int i = 0; i < 10; i++){
            while(!bucket[i].empty()){
                v[++index] = bucket[i].front();
                bucket[i].pop();
            }
        }exponent *= 10;
    }
}

int main(){

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;
    int logarithm = (int)(ceil)(log(v[i]) / log(10));
    digits =  (logarithm > digits) ? logarithm : digits;
}RadixSort(v, 0, N - 1, digits);

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